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


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
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/mix028_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 14:53:57,817 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:53:57,908 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:53:57,930 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:53:57,931 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:53:57,969 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:53:57,970 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:53:57,970 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:53:57,971 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:53:57,975 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 14:53:57,976 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:53:57,976 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:53:57,977 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:53:57,978 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 14:53:57,978 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 14:53:57,979 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:53:57,979 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:53:57,979 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 14:53:57,979 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 14:53:57,980 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 14:53:57,980 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 14:53:57,980 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:53:57,981 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:53:57,981 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:53:57,981 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 14:53:57,981 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 14:53:57,982 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 14:53:57,982 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 14:53:57,983 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:53:57,983 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 14:53:57,984 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:53:57,984 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 14:53:57,984 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:53:57,984 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:53:57,985 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:53:57,985 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:53:57,985 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 14:53:57,985 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:53:57,986 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:53:57,986 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:53:57,986 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:53:57,987 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:53:57,987 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:53:57,987 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-14 14:53:58,223 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:53:58,243 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:53:58,246 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:53:58,247 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 14:53:58,248 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 14:53:58,249 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 14:53:59,418 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:53:59,628 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 14:53:59,628 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 14:53:59,661 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a4b2774/6e07a7e8a9c84231b82449a2c37d5d9e/FLAG18c4c0dde
[2024-06-14 14:53:59,676 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a4b2774/6e07a7e8a9c84231b82449a2c37d5d9e
[2024-06-14 14:53:59,679 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:53:59,680 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 14:53:59,682 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/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-14 14:53:59,895 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:53:59,896 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:53:59,898 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:53:59,898 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:53:59,902 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:53:59,903 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:53:59" (1/2) ...
[2024-06-14 14:53:59,904 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e60dd65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:53:59, skipping insertion in model container
[2024-06-14 14:53:59,904 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:53:59" (1/2) ...
[2024-06-14 14:53:59,906 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7e48658a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:53:59, skipping insertion in model container
[2024-06-14 14:53:59,906 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:53:59" (2/2) ...
[2024-06-14 14:53:59,906 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e60dd65 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:53:59, skipping insertion in model container
[2024-06-14 14:53:59,906 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:53:59" (2/2) ...
[2024-06-14 14:53:59,907 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:53:59,996 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:53:59,997 INFO  L97    edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-14 14:53:59,998 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-14 14:53:59,999 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-14 14:54:00,000 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:54:00,000 INFO  L106   edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1;
[2024-06-14 14:54:00,058 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:54:00,425 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:54:00,434 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 14:54:00,843 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:54:00,932 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 14:54:00,933 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00 WrapperNode
[2024-06-14 14:54:00,933 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:54:00,934 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:54:00,934 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:54:00,934 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:54:00,941 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 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,004 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 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,133 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-14 14:54:01,134 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:54:01,135 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:54:01,135 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:54:01,135 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:54:01,146 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,146 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,189 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,250 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-14 14:54:01,251 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,251 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,300 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,303 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,329 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,336 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,362 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:54:01,363 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:54:01,363 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:54:01,364 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:54:01,364 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (1/1) ...
[2024-06-14 14:54:01,369 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:54:01,377 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:54:01,391 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-14 14:54:01,396 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-14 14:54:01,423 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:54:01,424 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:54:01,424 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:54:01,424 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:54:01,424 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:54:01,424 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:54:01,424 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 14:54:01,424 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 14:54:01,424 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:54:01,424 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:54:01,425 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:54:01,425 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:54:01,426 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 14:54:01,539 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 14:54:01,541 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:54:03,061 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:54:03,063 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 14:54:03,444 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:54:03,445 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:54:03,446 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:54:03 BoogieIcfgContainer
[2024-06-14 14:54:03,446 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:54:03,450 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:54:03,450 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:54:03,453 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:54:03,454 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:53:59" (1/4) ...
[2024-06-14 14:54:03,455 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e2caa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:54:03, skipping insertion in model container
[2024-06-14 14:54:03,455 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:53:59" (2/4) ...
[2024-06-14 14:54:03,456 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e2caa2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:54:03, skipping insertion in model container
[2024-06-14 14:54:03,456 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:54:00" (3/4) ...
[2024-06-14 14:54:03,457 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e2caa2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:54:03, skipping insertion in model container
[2024-06-14 14:54:03,457 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:54:03" (4/4) ...
[2024-06-14 14:54:03,458 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 14:54:03,477 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:54:03,478 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 14:54:03,478 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:54:03,622 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:54:03,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 14:54:03,738 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-14 14:54:03,739 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:54:03,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 14:54:03,743 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 14:54:03,747 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-14 14:54:03,795 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:54:03,815 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;@7d86367d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:54:03,816 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 14:54:03,826 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:54:03,840 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 14:54:03,840 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:54:03,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:03,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:03,842 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-14 14:54:03,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:03,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -1481508285, now seen corresponding path program 1 times
[2024-06-14 14:54:03,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:03,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314560782]
[2024-06-14 14:54:03,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:03,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:04,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:11,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:11,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:11,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314560782]
[2024-06-14 14:54:11,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314560782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:11,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:11,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:54:12,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546225780]
[2024-06-14 14:54:12,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:12,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:54:12,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:12,040 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:54:12,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:54:12,130 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:12,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:12,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:12,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:12,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:13,608 INFO  L124   PetriNetUnfolderBase]: 1659/2538 cut-off events.
[2024-06-14 14:54:13,608 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-14 14:54:13,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 2538 events. 1659/2538 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12026 event pairs, 1184 based on Foata normal form. 1/2498 useless extension candidates. Maximal degree in co-relation 5089. Up to 2465 conditions per place. 
[2024-06-14 14:54:13,631 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 35 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-14 14:54:13,631 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 179 flow
[2024-06-14 14:54:13,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 14:54:13,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:54:13,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2024-06-14 14:54:13,643 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-14 14:54:13,645 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 72 transitions.
[2024-06-14 14:54:13,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 179 flow
[2024-06-14 14:54:13,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 14:54:13,650 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-14 14:54:13,652 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-14 14:54:13,655 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-14 14:54:13,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-14 14:54:13,655 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:13,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:13,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:13,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:54:13,656 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-14 14:54:13,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:13,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -2095269470, now seen corresponding path program 1 times
[2024-06-14 14:54:13,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:13,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361283378]
[2024-06-14 14:54:13,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:13,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:13,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:19,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:19,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:19,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361283378]
[2024-06-14 14:54:19,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361283378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:19,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:19,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:54:19,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342190353]
[2024-06-14 14:54:19,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:19,218 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:54:19,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:19,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:54:19,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:54:19,383 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:19,384 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:19,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:19,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:19,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:20,657 INFO  L124   PetriNetUnfolderBase]: 1653/2529 cut-off events.
[2024-06-14 14:54:20,658 INFO  L125   PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES.
[2024-06-14 14:54:20,662 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 2529 events. 1653/2529 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12029 event pairs, 1038 based on Foata normal form. 3/2531 useless extension candidates. Maximal degree in co-relation 5705. Up to 2441 conditions per place. 
[2024-06-14 14:54:20,677 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-14 14:54:20,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 246 flow
[2024-06-14 14:54:20,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 14:54:20,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:54:20,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-14 14:54:20,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-14 14:54:20,682 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 92 transitions.
[2024-06-14 14:54:20,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 246 flow
[2024-06-14 14:54:20,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:54:20,686 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-14 14:54:20,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-14 14:54:20,687 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-14 14:54:20,688 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-14 14:54:20,688 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:20,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:20,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:20,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:54:20,692 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-14 14:54:20,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:20,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -528843524, now seen corresponding path program 1 times
[2024-06-14 14:54:20,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:20,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897413718]
[2024-06-14 14:54:20,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:20,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:20,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:26,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:26,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:26,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897413718]
[2024-06-14 14:54:26,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897413718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:26,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:26,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 14:54:26,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394468830]
[2024-06-14 14:54:26,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:26,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 14:54:26,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:26,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 14:54:26,617 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 14:54:26,782 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:26,783 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:26,783 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:26,783 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:26,783 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:28,015 INFO  L124   PetriNetUnfolderBase]: 1661/2559 cut-off events.
[2024-06-14 14:54:28,015 INFO  L125   PetriNetUnfolderBase]: For 1306/1306 co-relation queries the response was YES.
[2024-06-14 14:54:28,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6387 conditions, 2559 events. 1661/2559 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12225 event pairs, 812 based on Foata normal form. 5/2563 useless extension candidates. Maximal degree in co-relation 6370. Up to 2387 conditions per place. 
[2024-06-14 14:54:28,034 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 55 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-14 14:54:28,035 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 400 flow
[2024-06-14 14:54:28,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:54:28,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:54:28,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions.
[2024-06-14 14:54:28,037 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-14 14:54:28,037 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 120 transitions.
[2024-06-14 14:54:28,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 400 flow
[2024-06-14 14:54:28,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 386 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 14:54:28,040 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow
[2024-06-14 14:54:28,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-06-14 14:54:28,041 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-14 14:54:28,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow
[2024-06-14 14:54:28,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:28,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:28,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:28,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:54:28,042 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:28,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:28,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 1395244437, now seen corresponding path program 1 times
[2024-06-14 14:54:28,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:28,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283275089]
[2024-06-14 14:54:28,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:28,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:28,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:33,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:33,884 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:33,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283275089]
[2024-06-14 14:54:33,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283275089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:33,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:33,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:54:33,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688116457]
[2024-06-14 14:54:33,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:33,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:54:33,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:33,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:54:33,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:54:34,047 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:34,047 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:34,047 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:34,048 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:34,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:35,561 INFO  L124   PetriNetUnfolderBase]: 1669/2571 cut-off events.
[2024-06-14 14:54:35,561 INFO  L125   PetriNetUnfolderBase]: For 3038/3040 co-relation queries the response was YES.
[2024-06-14 14:54:35,565 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 2571 events. 1669/2571 cut-off events. For 3038/3040 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12272 event pairs, 666 based on Foata normal form. 7/2577 useless extension candidates. Maximal degree in co-relation 7486. Up to 2373 conditions per place. 
[2024-06-14 14:54:35,576 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 61 selfloop transitions, 21 changer transitions 0/86 dead transitions.
[2024-06-14 14:54:35,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 527 flow
[2024-06-14 14:54:35,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:54:35,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:54:35,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-14 14:54:35,581 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5136054421768708
[2024-06-14 14:54:35,582 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 7 states and 151 transitions.
[2024-06-14 14:54:35,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 527 flow
[2024-06-14 14:54:35,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 519 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-14 14:54:35,589 INFO  L231             Difference]: Finished difference. Result has 58 places, 54 transitions, 312 flow
[2024-06-14 14:54:35,589 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=58, PETRI_TRANSITIONS=54}
[2024-06-14 14:54:35,590 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places.
[2024-06-14 14:54:35,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 312 flow
[2024-06-14 14:54:35,591 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:35,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:35,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:35,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:54:35,592 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:35,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:35,592 INFO  L85        PathProgramCache]: Analyzing trace with hash 302905255, now seen corresponding path program 1 times
[2024-06-14 14:54:35,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:35,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759581183]
[2024-06-14 14:54:35,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:35,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:35,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:41,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:41,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:41,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759581183]
[2024-06-14 14:54:41,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759581183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:41,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:41,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:54:41,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994830825]
[2024-06-14 14:54:41,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:41,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:54:41,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:41,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:54:41,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:54:41,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:41,770 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 312 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:41,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:41,770 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:41,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:43,222 INFO  L124   PetriNetUnfolderBase]: 1681/2591 cut-off events.
[2024-06-14 14:54:43,222 INFO  L125   PetriNetUnfolderBase]: For 4787/4789 co-relation queries the response was YES.
[2024-06-14 14:54:43,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8378 conditions, 2591 events. 1681/2591 cut-off events. For 4787/4789 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12361 event pairs, 502 based on Foata normal form. 12/2602 useless extension candidates. Maximal degree in co-relation 8354. Up to 2341 conditions per place. 
[2024-06-14 14:54:43,234 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 66 selfloop transitions, 23 changer transitions 0/93 dead transitions.
[2024-06-14 14:54:43,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 630 flow
[2024-06-14 14:54:43,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:54:43,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:54:43,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions.
[2024-06-14 14:54:43,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5374149659863946
[2024-06-14 14:54:43,236 INFO  L175             Difference]: Start difference. First operand has 58 places, 54 transitions, 312 flow. Second operand 7 states and 158 transitions.
[2024-06-14 14:54:43,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 630 flow
[2024-06-14 14:54:43,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 579 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-14 14:54:43,242 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 337 flow
[2024-06-14 14:54:43,242 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-14 14:54:43,243 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-14 14:54:43,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 337 flow
[2024-06-14 14:54:43,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:43,244 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:43,244 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:43,244 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:54:43,244 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-14 14:54:43,244 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:43,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -1537941434, now seen corresponding path program 1 times
[2024-06-14 14:54:43,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:43,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305560164]
[2024-06-14 14:54:43,245 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:43,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:43,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:54,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:54,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:54,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305560164]
[2024-06-14 14:54:54,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305560164] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:54,202 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:54,202 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:54:54,202 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080439571]
[2024-06-14 14:54:54,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:54,202 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:54:54,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:54,203 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:54:54,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:54:54,331 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:54:54,331 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 337 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:54,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:54,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:54:54,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:55,338 INFO  L124   PetriNetUnfolderBase]: 1676/2580 cut-off events.
[2024-06-14 14:54:55,338 INFO  L125   PetriNetUnfolderBase]: For 6458/6458 co-relation queries the response was YES.
[2024-06-14 14:54:55,342 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8899 conditions, 2580 events. 1676/2580 cut-off events. For 6458/6458 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12279 event pairs, 659 based on Foata normal form. 2/2581 useless extension candidates. Maximal degree in co-relation 8875. Up to 2484 conditions per place. 
[2024-06-14 14:54:55,352 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 55 selfloop transitions, 8 changer transitions 0/67 dead transitions.
[2024-06-14 14:54:55,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 491 flow
[2024-06-14 14:54:55,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:54:55,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:54:55,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-14 14:54:55,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-14 14:54:55,354 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 337 flow. Second operand 5 states and 92 transitions.
[2024-06-14 14:54:55,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 491 flow
[2024-06-14 14:54:55,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 427 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 14:54:55,360 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 297 flow
[2024-06-14 14:54:55,360 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-14 14:54:55,361 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-14 14:54:55,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 297 flow
[2024-06-14 14:54:55,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:55,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:55,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:55,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:54:55,362 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-14 14:54:55,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:55,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -431946306, now seen corresponding path program 1 times
[2024-06-14 14:54:55,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:55,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886709963]
[2024-06-14 14:54:55,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:55,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:55,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:06,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:06,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:06,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886709963]
[2024-06-14 14:55:06,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886709963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:06,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:06,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:55:06,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169711202]
[2024-06-14 14:55:06,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:06,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:55:06,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:06,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:55:06,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:55:06,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:55:06,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 297 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-14 14:55:06,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:06,304 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:55:06,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:07,566 INFO  L124   PetriNetUnfolderBase]: 1932/2872 cut-off events.
[2024-06-14 14:55:07,566 INFO  L125   PetriNetUnfolderBase]: For 8815/8815 co-relation queries the response was YES.
[2024-06-14 14:55:07,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10015 conditions, 2872 events. 1932/2872 cut-off events. For 8815/8815 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13056 event pairs, 727 based on Foata normal form. 6/2877 useless extension candidates. Maximal degree in co-relation 9989. Up to 2802 conditions per place. 
[2024-06-14 14:55:07,580 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 66 selfloop transitions, 17 changer transitions 0/86 dead transitions.
[2024-06-14 14:55:07,580 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 593 flow
[2024-06-14 14:55:07,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:55:07,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:55:07,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 14:55:07,581 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-14 14:55:07,582 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 297 flow. Second operand 6 states and 111 transitions.
[2024-06-14 14:55:07,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 593 flow
[2024-06-14 14:55:07,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 571 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 14:55:07,587 INFO  L231             Difference]: Finished difference. Result has 63 places, 67 transitions, 406 flow
[2024-06-14 14:55:07,588 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=63, PETRI_TRANSITIONS=67}
[2024-06-14 14:55:07,588 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-14 14:55:07,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 406 flow
[2024-06-14 14:55:07,589 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-14 14:55:07,589 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:07,589 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:07,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:55:07,589 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-14 14:55:07,590 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:07,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -871327101, now seen corresponding path program 1 times
[2024-06-14 14:55:07,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:07,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212503975]
[2024-06-14 14:55:07,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:07,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:07,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:15,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:15,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:15,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212503975]
[2024-06-14 14:55:15,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212503975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:15,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:15,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:55:15,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642637592]
[2024-06-14 14:55:15,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:15,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:55:15,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:15,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:55:15,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:55:15,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:15,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 406 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:15,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:15,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:15,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:16,683 INFO  L124   PetriNetUnfolderBase]: 1744/2687 cut-off events.
[2024-06-14 14:55:16,684 INFO  L125   PetriNetUnfolderBase]: For 10848/10862 co-relation queries the response was YES.
[2024-06-14 14:55:16,689 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10192 conditions, 2687 events. 1744/2687 cut-off events. For 10848/10862 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12861 event pairs, 651 based on Foata normal form. 8/2679 useless extension candidates. Maximal degree in co-relation 10164. Up to 2489 conditions per place. 
[2024-06-14 14:55:16,700 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 19 changer transitions 0/90 dead transitions.
[2024-06-14 14:55:16,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 672 flow
[2024-06-14 14:55:16,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:55:16,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:55:16,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-14 14:55:16,703 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 14:55:16,703 INFO  L175             Difference]: Start difference. First operand has 63 places, 67 transitions, 406 flow. Second operand 6 states and 117 transitions.
[2024-06-14 14:55:16,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 672 flow
[2024-06-14 14:55:16,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 654 flow, removed 8 selfloop flow, removed 1 redundant places.
[2024-06-14 14:55:16,720 INFO  L231             Difference]: Finished difference. Result has 68 places, 70 transitions, 460 flow
[2024-06-14 14:55:16,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=68, PETRI_TRANSITIONS=70}
[2024-06-14 14:55:16,723 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-14 14:55:16,724 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 460 flow
[2024-06-14 14:55:16,724 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:16,724 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:16,724 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:16,724 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:55:16,725 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-14 14:55:16,725 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:16,725 INFO  L85        PathProgramCache]: Analyzing trace with hash -492927771, now seen corresponding path program 2 times
[2024-06-14 14:55:16,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:16,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597711279]
[2024-06-14 14:55:16,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:16,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:16,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:24,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:24,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:24,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597711279]
[2024-06-14 14:55:24,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597711279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:24,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:24,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:55:24,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295663225]
[2024-06-14 14:55:24,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:24,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:55:24,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:24,309 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:55:24,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:55:24,433 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:24,434 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 460 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:24,434 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:24,434 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:24,434 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:25,523 INFO  L124   PetriNetUnfolderBase]: 1729/2661 cut-off events.
[2024-06-14 14:55:25,524 INFO  L125   PetriNetUnfolderBase]: For 12020/12030 co-relation queries the response was YES.
[2024-06-14 14:55:25,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10272 conditions, 2661 events. 1729/2661 cut-off events. For 12020/12030 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12724 event pairs, 647 based on Foata normal form. 2/2647 useless extension candidates. Maximal degree in co-relation 10241. Up to 2530 conditions per place. 
[2024-06-14 14:55:25,545 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 67 selfloop transitions, 11 changer transitions 0/85 dead transitions.
[2024-06-14 14:55:25,545 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 654 flow
[2024-06-14 14:55:25,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:55:25,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:55:25,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-14 14:55:25,547 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:55:25,547 INFO  L175             Difference]: Start difference. First operand has 68 places, 70 transitions, 460 flow. Second operand 6 states and 108 transitions.
[2024-06-14 14:55:25,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 654 flow
[2024-06-14 14:55:25,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 625 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:55:25,559 INFO  L231             Difference]: Finished difference. Result has 71 places, 70 transitions, 461 flow
[2024-06-14 14:55:25,559 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=71, PETRI_TRANSITIONS=70}
[2024-06-14 14:55:25,560 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places.
[2024-06-14 14:55:25,560 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 461 flow
[2024-06-14 14:55:25,561 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:25,561 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:25,561 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:25,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:55:25,561 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-14 14:55:25,562 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:25,562 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241334843, now seen corresponding path program 1 times
[2024-06-14 14:55:25,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:25,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722478277]
[2024-06-14 14:55:25,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:25,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:25,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:34,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-14 14:55:34,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:34,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722478277]
[2024-06-14 14:55:34,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722478277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:34,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:34,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:55:34,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631377325]
[2024-06-14 14:55:34,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:34,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:55:34,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:34,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:55:34,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:55:34,930 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:55:34,930 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 461 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 14:55:34,930 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:34,930 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:55:34,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:36,189 INFO  L124   PetriNetUnfolderBase]: 2091/3095 cut-off events.
[2024-06-14 14:55:36,189 INFO  L125   PetriNetUnfolderBase]: For 17186/17190 co-relation queries the response was YES.
[2024-06-14 14:55:36,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12369 conditions, 3095 events. 2091/3095 cut-off events. For 17186/17190 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14126 event pairs, 649 based on Foata normal form. 13/3107 useless extension candidates. Maximal degree in co-relation 12337. Up to 2721 conditions per place. 
[2024-06-14 14:55:36,211 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 88 selfloop transitions, 31 changer transitions 0/122 dead transitions.
[2024-06-14 14:55:36,212 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 989 flow
[2024-06-14 14:55:36,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:55:36,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:55:36,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-14 14:55:36,214 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 14:55:36,214 INFO  L175             Difference]: Start difference. First operand has 71 places, 70 transitions, 461 flow. Second operand 7 states and 140 transitions.
[2024-06-14 14:55:36,214 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 989 flow
[2024-06-14 14:55:36,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 122 transitions, 942 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 14:55:36,231 INFO  L231             Difference]: Finished difference. Result has 75 places, 89 transitions, 662 flow
[2024-06-14 14:55:36,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=662, PETRI_PLACES=75, PETRI_TRANSITIONS=89}
[2024-06-14 14:55:36,233 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-14 14:55:36,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 662 flow
[2024-06-14 14:55:36,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 14:55:36,237 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:36,237 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:36,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:55:36,238 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-14 14:55:36,239 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:36,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905365905, now seen corresponding path program 2 times
[2024-06-14 14:55:36,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:36,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956643920]
[2024-06-14 14:55:36,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:36,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:36,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:44,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:44,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:44,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956643920]
[2024-06-14 14:55:44,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956643920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:44,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:44,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:55:44,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146897234]
[2024-06-14 14:55:44,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:44,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:55:44,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:44,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:55:44,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:55:44,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:55:44,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 662 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 14:55:44,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:44,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:55:44,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:46,205 INFO  L124   PetriNetUnfolderBase]: 2127/3146 cut-off events.
[2024-06-14 14:55:46,205 INFO  L125   PetriNetUnfolderBase]: For 22973/22973 co-relation queries the response was YES.
[2024-06-14 14:55:46,211 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14509 conditions, 3146 events. 2127/3146 cut-off events. For 22973/22973 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14318 event pairs, 690 based on Foata normal form. 6/3151 useless extension candidates. Maximal degree in co-relation 14473. Up to 3007 conditions per place. 
[2024-06-14 14:55:46,223 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 98 selfloop transitions, 23 changer transitions 0/124 dead transitions.
[2024-06-14 14:55:46,224 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 124 transitions, 1146 flow
[2024-06-14 14:55:46,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:55:46,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:55:46,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-14 14:55:46,225 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-14 14:55:46,226 INFO  L175             Difference]: Start difference. First operand has 75 places, 89 transitions, 662 flow. Second operand 7 states and 130 transitions.
[2024-06-14 14:55:46,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 124 transitions, 1146 flow
[2024-06-14 14:55:46,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 1102 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-14 14:55:46,248 INFO  L231             Difference]: Finished difference. Result has 82 places, 97 transitions, 770 flow
[2024-06-14 14:55:46,249 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=770, PETRI_PLACES=82, PETRI_TRANSITIONS=97}
[2024-06-14 14:55:46,249 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2024-06-14 14:55:46,249 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 770 flow
[2024-06-14 14:55:46,249 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 14:55:46,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:46,250 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:46,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:55:46,250 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-14 14:55:46,250 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:46,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063966173, now seen corresponding path program 3 times
[2024-06-14 14:55:46,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:46,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209569634]
[2024-06-14 14:55:46,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:46,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:46,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:54,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:54,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:54,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209569634]
[2024-06-14 14:55:54,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209569634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:54,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:54,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:55:54,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114937430]
[2024-06-14 14:55:54,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:54,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:55:54,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:54,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:55:54,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:55:54,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:55:54,301 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 770 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 14:55:54,301 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:54,301 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:55:54,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:55,638 INFO  L124   PetriNetUnfolderBase]: 2131/3152 cut-off events.
[2024-06-14 14:55:55,638 INFO  L125   PetriNetUnfolderBase]: For 27428/27428 co-relation queries the response was YES.
[2024-06-14 14:55:55,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15157 conditions, 3152 events. 2131/3152 cut-off events. For 27428/27428 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14356 event pairs, 689 based on Foata normal form. 6/3157 useless extension candidates. Maximal degree in co-relation 15117. Up to 3076 conditions per place. 
[2024-06-14 14:55:55,660 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 101 selfloop transitions, 21 changer transitions 0/125 dead transitions.
[2024-06-14 14:55:55,660 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 1174 flow
[2024-06-14 14:55:55,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:55:55,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:55:55,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 14:55:55,662 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:55:55,662 INFO  L175             Difference]: Start difference. First operand has 82 places, 97 transitions, 770 flow. Second operand 7 states and 126 transitions.
[2024-06-14 14:55:55,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 1174 flow
[2024-06-14 14:55:55,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 1125 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-14 14:55:55,691 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 848 flow
[2024-06-14 14:55:55,691 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2024-06-14 14:55:55,692 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-14 14:55:55,692 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 848 flow
[2024-06-14 14:55:55,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 14:55:55,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:55,693 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:55,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:55:55,693 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-14 14:55:55,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:55,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511477053, now seen corresponding path program 1 times
[2024-06-14 14:55:55,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:55,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713067067]
[2024-06-14 14:55:55,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:55,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:55,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:07,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:07,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:07,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713067067]
[2024-06-14 14:56:07,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713067067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:07,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:07,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:56:07,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102082934]
[2024-06-14 14:56:07,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:07,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:56:07,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:07,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:56:07,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:56:07,298 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:07,299 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 848 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:07,299 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:07,299 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:07,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:08,684 INFO  L124   PetriNetUnfolderBase]: 2134/3157 cut-off events.
[2024-06-14 14:56:08,684 INFO  L125   PetriNetUnfolderBase]: For 30219/30219 co-relation queries the response was YES.
[2024-06-14 14:56:08,690 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15528 conditions, 3157 events. 2134/3157 cut-off events. For 30219/30219 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14391 event pairs, 668 based on Foata normal form. 6/3162 useless extension candidates. Maximal degree in co-relation 15486. Up to 3061 conditions per place. 
[2024-06-14 14:56:08,698 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 25 changer transitions 0/128 dead transitions.
[2024-06-14 14:56:08,698 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 128 transitions, 1232 flow
[2024-06-14 14:56:08,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:56:08,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:56:08,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 14:56:08,699 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-14 14:56:08,699 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 848 flow. Second operand 7 states and 127 transitions.
[2024-06-14 14:56:08,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 128 transitions, 1232 flow
[2024-06-14 14:56:08,719 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 128 transitions, 1179 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 14:56:08,722 INFO  L231             Difference]: Finished difference. Result has 90 places, 106 transitions, 891 flow
[2024-06-14 14:56:08,723 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=891, PETRI_PLACES=90, PETRI_TRANSITIONS=106}
[2024-06-14 14:56:08,723 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places.
[2024-06-14 14:56:08,723 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 106 transitions, 891 flow
[2024-06-14 14:56:08,724 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:08,724 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:08,724 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:08,724 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:56:08,724 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:08,725 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:08,725 INFO  L85        PathProgramCache]: Analyzing trace with hash -2050156111, now seen corresponding path program 1 times
[2024-06-14 14:56:08,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:08,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131537462]
[2024-06-14 14:56:08,725 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:08,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:08,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:21,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:21,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:21,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131537462]
[2024-06-14 14:56:21,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131537462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:21,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:21,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:56:21,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845333179]
[2024-06-14 14:56:21,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:21,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:56:21,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:21,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:56:21,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:56:21,254 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:21,254 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 106 transitions, 891 flow. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:21,254 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:21,254 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:21,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:22,460 INFO  L124   PetriNetUnfolderBase]: 2131/3153 cut-off events.
[2024-06-14 14:56:22,460 INFO  L125   PetriNetUnfolderBase]: For 32999/32999 co-relation queries the response was YES.
[2024-06-14 14:56:22,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15973 conditions, 3153 events. 2131/3153 cut-off events. For 32999/32999 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14370 event pairs, 692 based on Foata normal form. 1/3153 useless extension candidates. Maximal degree in co-relation 15930. Up to 3137 conditions per place. 
[2024-06-14 14:56:22,477 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 103 selfloop transitions, 8 changer transitions 0/114 dead transitions.
[2024-06-14 14:56:22,477 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 114 transitions, 1133 flow
[2024-06-14 14:56:22,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:56:22,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:56:22,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions.
[2024-06-14 14:56:22,478 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 14:56:22,479 INFO  L175             Difference]: Start difference. First operand has 90 places, 106 transitions, 891 flow. Second operand 5 states and 84 transitions.
[2024-06-14 14:56:22,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 114 transitions, 1133 flow
[2024-06-14 14:56:22,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 114 transitions, 1053 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:56:22,500 INFO  L231             Difference]: Finished difference. Result has 90 places, 106 transitions, 833 flow
[2024-06-14 14:56:22,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=833, PETRI_PLACES=90, PETRI_TRANSITIONS=106}
[2024-06-14 14:56:22,500 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places.
[2024-06-14 14:56:22,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 106 transitions, 833 flow
[2024-06-14 14:56:22,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:22,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:22,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:22,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:56:22,502 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-14 14:56:22,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:22,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -1532581170, now seen corresponding path program 1 times
[2024-06-14 14:56:22,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:22,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198663332]
[2024-06-14 14:56:22,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:22,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:22,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:31,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:31,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:31,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198663332]
[2024-06-14 14:56:31,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198663332] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:31,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:31,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:56:31,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648724770]
[2024-06-14 14:56:31,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:31,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:56:31,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:31,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:56:31,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:56:31,858 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:31,858 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 106 transitions, 833 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-14 14:56:31,859 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:31,859 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:31,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:33,190 INFO  L124   PetriNetUnfolderBase]: 2008/3036 cut-off events.
[2024-06-14 14:56:33,190 INFO  L125   PetriNetUnfolderBase]: For 35233/35269 co-relation queries the response was YES.
[2024-06-14 14:56:33,198 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15404 conditions, 3036 events. 2008/3036 cut-off events. For 35233/35269 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14354 event pairs, 607 based on Foata normal form. 14/3029 useless extension candidates. Maximal degree in co-relation 15360. Up to 2758 conditions per place. 
[2024-06-14 14:56:33,209 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 97 selfloop transitions, 26 changer transitions 0/139 dead transitions.
[2024-06-14 14:56:33,209 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 139 transitions, 1281 flow
[2024-06-14 14:56:33,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:56:33,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:56:33,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 14:56:33,212 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-14 14:56:33,212 INFO  L175             Difference]: Start difference. First operand has 90 places, 106 transitions, 833 flow. Second operand 7 states and 136 transitions.
[2024-06-14 14:56:33,212 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 139 transitions, 1281 flow
[2024-06-14 14:56:33,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 139 transitions, 1257 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-14 14:56:33,236 INFO  L231             Difference]: Finished difference. Result has 93 places, 112 transitions, 955 flow
[2024-06-14 14:56:33,236 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=955, PETRI_PLACES=93, PETRI_TRANSITIONS=112}
[2024-06-14 14:56:33,237 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-14 14:56:33,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 112 transitions, 955 flow
[2024-06-14 14:56:33,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-14 14:56:33,237 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:33,238 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:33,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:56:33,238 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-14 14:56:33,238 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:33,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 169602052, now seen corresponding path program 2 times
[2024-06-14 14:56:33,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:33,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845554912]
[2024-06-14 14:56:33,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:33,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:33,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:43,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:43,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:43,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845554912]
[2024-06-14 14:56:43,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845554912] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:43,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:43,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:56:43,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339306980]
[2024-06-14 14:56:43,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:43,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:56:43,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:43,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:56:43,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:56:43,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:43,835 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 112 transitions, 955 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-14 14:56:43,835 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:43,835 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:43,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:45,074 INFO  L124   PetriNetUnfolderBase]: 2003/3029 cut-off events.
[2024-06-14 14:56:45,074 INFO  L125   PetriNetUnfolderBase]: For 39893/39929 co-relation queries the response was YES.
[2024-06-14 14:56:45,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15999 conditions, 3029 events. 2003/3029 cut-off events. For 39893/39929 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14290 event pairs, 607 based on Foata normal form. 14/3022 useless extension candidates. Maximal degree in co-relation 15955. Up to 2786 conditions per place. 
[2024-06-14 14:56:45,089 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 96 selfloop transitions, 22 changer transitions 0/134 dead transitions.
[2024-06-14 14:56:45,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 134 transitions, 1247 flow
[2024-06-14 14:56:45,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:56:45,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:56:45,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-14 14:56:45,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-14 14:56:45,093 INFO  L175             Difference]: Start difference. First operand has 93 places, 112 transitions, 955 flow. Second operand 7 states and 131 transitions.
[2024-06-14 14:56:45,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 134 transitions, 1247 flow
[2024-06-14 14:56:45,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 1166 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-14 14:56:45,120 INFO  L231             Difference]: Finished difference. Result has 97 places, 112 transitions, 926 flow
[2024-06-14 14:56:45,121 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=926, PETRI_PLACES=97, PETRI_TRANSITIONS=112}
[2024-06-14 14:56:45,121 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2024-06-14 14:56:45,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 926 flow
[2024-06-14 14:56:45,122 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-14 14:56:45,122 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:45,122 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:45,122 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:56:45,122 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-14 14:56:45,123 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:45,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -1528771735, now seen corresponding path program 1 times
[2024-06-14 14:56:45,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:45,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748197848]
[2024-06-14 14:56:45,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:45,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:45,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:53,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:53,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:53,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748197848]
[2024-06-14 14:56:53,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748197848] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:53,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:53,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:56:53,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112157344]
[2024-06-14 14:56:53,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:53,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:56:53,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:53,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:56:53,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:56:53,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:53,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 926 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:53,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:53,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:53,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:55,151 INFO  L124   PetriNetUnfolderBase]: 2173/3215 cut-off events.
[2024-06-14 14:56:55,152 INFO  L125   PetriNetUnfolderBase]: For 45850/45856 co-relation queries the response was YES.
[2024-06-14 14:56:55,159 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 3215 events. 2173/3215 cut-off events. For 45850/45856 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14676 event pairs, 638 based on Foata normal form. 8/3222 useless extension candidates. Maximal degree in co-relation 17247. Up to 2785 conditions per place. 
[2024-06-14 14:56:55,167 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 103 selfloop transitions, 47 changer transitions 0/153 dead transitions.
[2024-06-14 14:56:55,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 153 transitions, 1556 flow
[2024-06-14 14:56:55,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:56:55,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:56:55,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-14 14:56:55,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-14 14:56:55,169 INFO  L175             Difference]: Start difference. First operand has 97 places, 112 transitions, 926 flow. Second operand 7 states and 142 transitions.
[2024-06-14 14:56:55,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 153 transitions, 1556 flow
[2024-06-14 14:56:55,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 153 transitions, 1501 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 14:56:55,193 INFO  L231             Difference]: Finished difference. Result has 100 places, 120 transitions, 1127 flow
[2024-06-14 14:56:55,193 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1127, PETRI_PLACES=100, PETRI_TRANSITIONS=120}
[2024-06-14 14:56:55,194 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-14 14:56:55,194 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 120 transitions, 1127 flow
[2024-06-14 14:56:55,194 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:55,194 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:55,194 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:55,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:56:55,195 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-14 14:56:55,195 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:55,195 INFO  L85        PathProgramCache]: Analyzing trace with hash 173326857, now seen corresponding path program 2 times
[2024-06-14 14:56:55,195 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:55,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165331072]
[2024-06-14 14:56:55,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:55,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:55,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:04,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-14 14:57:04,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:04,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165331072]
[2024-06-14 14:57:04,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165331072] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:04,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:04,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:57:04,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355746599]
[2024-06-14 14:57:04,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:04,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:57:04,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:04,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:57:04,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:57:04,335 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:57:04,336 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 120 transitions, 1127 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:04,336 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:04,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:57:04,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:05,583 INFO  L124   PetriNetUnfolderBase]: 2209/3267 cut-off events.
[2024-06-14 14:57:05,583 INFO  L125   PetriNetUnfolderBase]: For 53310/53316 co-relation queries the response was YES.
[2024-06-14 14:57:05,591 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18752 conditions, 3267 events. 2209/3267 cut-off events. For 53310/53316 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15004 event pairs, 637 based on Foata normal form. 8/3274 useless extension candidates. Maximal degree in co-relation 18703. Up to 2815 conditions per place. 
[2024-06-14 14:57:05,601 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 48 changer transitions 0/153 dead transitions.
[2024-06-14 14:57:05,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 1683 flow
[2024-06-14 14:57:05,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:57:05,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:57:05,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 14:57:05,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 14:57:05,603 INFO  L175             Difference]: Start difference. First operand has 100 places, 120 transitions, 1127 flow. Second operand 7 states and 137 transitions.
[2024-06-14 14:57:05,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 1683 flow
[2024-06-14 14:57:05,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 153 transitions, 1596 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-14 14:57:05,649 INFO  L231             Difference]: Finished difference. Result has 104 places, 124 transitions, 1204 flow
[2024-06-14 14:57:05,649 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1204, PETRI_PLACES=104, PETRI_TRANSITIONS=124}
[2024-06-14 14:57:05,649 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-14 14:57:05,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 1204 flow
[2024-06-14 14:57:05,650 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:05,650 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:05,650 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:05,650 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:57:05,650 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-14 14:57:05,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:05,651 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249785523, now seen corresponding path program 3 times
[2024-06-14 14:57:05,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:05,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500975490]
[2024-06-14 14:57:05,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:05,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:05,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:14,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:14,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:14,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500975490]
[2024-06-14 14:57:14,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500975490] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:14,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:14,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:57:14,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866095102]
[2024-06-14 14:57:14,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:14,425 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:57:14,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:14,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:57:14,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:57:14,600 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:57:14,601 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 1204 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:14,601 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:14,601 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:57:14,601 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:15,880 INFO  L124   PetriNetUnfolderBase]: 2213/3273 cut-off events.
[2024-06-14 14:57:15,880 INFO  L125   PetriNetUnfolderBase]: For 57784/57790 co-relation queries the response was YES.
[2024-06-14 14:57:15,888 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18949 conditions, 3273 events. 2213/3273 cut-off events. For 57784/57790 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14995 event pairs, 678 based on Foata normal form. 12/3284 useless extension candidates. Maximal degree in co-relation 18899. Up to 3164 conditions per place. 
[2024-06-14 14:57:15,898 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 124 selfloop transitions, 23 changer transitions 0/150 dead transitions.
[2024-06-14 14:57:15,898 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 150 transitions, 1649 flow
[2024-06-14 14:57:15,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:57:15,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:57:15,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 14:57:15,899 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-14 14:57:15,899 INFO  L175             Difference]: Start difference. First operand has 104 places, 124 transitions, 1204 flow. Second operand 7 states and 127 transitions.
[2024-06-14 14:57:15,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 150 transitions, 1649 flow
[2024-06-14 14:57:15,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1558 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 14:57:15,941 INFO  L231             Difference]: Finished difference. Result has 107 places, 128 transitions, 1233 flow
[2024-06-14 14:57:15,942 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1233, PETRI_PLACES=107, PETRI_TRANSITIONS=128}
[2024-06-14 14:57:15,942 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places.
[2024-06-14 14:57:15,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 128 transitions, 1233 flow
[2024-06-14 14:57:15,943 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:15,943 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:15,943 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:15,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:57:15,943 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-14 14:57:15,944 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:15,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578646960, now seen corresponding path program 1 times
[2024-06-14 14:57:15,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:15,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188200947]
[2024-06-14 14:57:15,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:15,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:16,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:23,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:23,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:23,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188200947]
[2024-06-14 14:57:23,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188200947] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:23,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:23,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:57:23,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064487662]
[2024-06-14 14:57:23,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:23,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:57:23,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:23,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:57:23,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:57:23,759 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:57:23,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 128 transitions, 1233 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-14 14:57:23,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:23,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:57:23,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:25,027 INFO  L124   PetriNetUnfolderBase]: 2215/3275 cut-off events.
[2024-06-14 14:57:25,027 INFO  L125   PetriNetUnfolderBase]: For 61801/61801 co-relation queries the response was YES.
[2024-06-14 14:57:25,037 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19060 conditions, 3275 events. 2215/3275 cut-off events. For 61801/61801 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15024 event pairs, 665 based on Foata normal form. 3/3277 useless extension candidates. Maximal degree in co-relation 19009. Up to 3168 conditions per place. 
[2024-06-14 14:57:25,048 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 120 selfloop transitions, 30 changer transitions 0/153 dead transitions.
[2024-06-14 14:57:25,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 153 transitions, 1681 flow
[2024-06-14 14:57:25,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:57:25,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:57:25,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 14:57:25,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-14 14:57:25,049 INFO  L175             Difference]: Start difference. First operand has 107 places, 128 transitions, 1233 flow. Second operand 7 states and 127 transitions.
[2024-06-14 14:57:25,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 153 transitions, 1681 flow
[2024-06-14 14:57:25,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 153 transitions, 1612 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-14 14:57:25,139 INFO  L231             Difference]: Finished difference. Result has 109 places, 132 transitions, 1302 flow
[2024-06-14 14:57:25,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1302, PETRI_PLACES=109, PETRI_TRANSITIONS=132}
[2024-06-14 14:57:25,140 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-14 14:57:25,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 132 transitions, 1302 flow
[2024-06-14 14:57:25,140 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-14 14:57:25,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:25,140 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:25,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:57:25,141 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:25,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:25,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 869671367, now seen corresponding path program 1 times
[2024-06-14 14:57:25,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:25,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025303537]
[2024-06-14 14:57:25,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:25,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:25,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:38,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:38,813 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:38,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025303537]
[2024-06-14 14:57:38,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025303537] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:38,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:38,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:57:38,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859847386]
[2024-06-14 14:57:38,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:38,814 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:57:38,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:38,814 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:57:38,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:57:38,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:57:38,910 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 132 transitions, 1302 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 14:57:38,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:38,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:57:38,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:40,233 INFO  L124   PetriNetUnfolderBase]: 2206/3263 cut-off events.
[2024-06-14 14:57:40,234 INFO  L125   PetriNetUnfolderBase]: For 66112/66112 co-relation queries the response was YES.
[2024-06-14 14:57:40,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19605 conditions, 3263 events. 2206/3263 cut-off events. For 66112/66112 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14844 event pairs, 674 based on Foata normal form. 3/3265 useless extension candidates. Maximal degree in co-relation 19553. Up to 3238 conditions per place. 
[2024-06-14 14:57:40,252 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 132 selfloop transitions, 11 changer transitions 0/146 dead transitions.
[2024-06-14 14:57:40,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 146 transitions, 1640 flow
[2024-06-14 14:57:40,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:57:40,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:57:40,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-14 14:57:40,253 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-14 14:57:40,253 INFO  L175             Difference]: Start difference. First operand has 109 places, 132 transitions, 1302 flow. Second operand 6 states and 98 transitions.
[2024-06-14 14:57:40,254 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 146 transitions, 1640 flow
[2024-06-14 14:57:40,297 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 1552 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-14 14:57:40,299 INFO  L231             Difference]: Finished difference. Result has 110 places, 135 transitions, 1274 flow
[2024-06-14 14:57:40,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1274, PETRI_PLACES=110, PETRI_TRANSITIONS=135}
[2024-06-14 14:57:40,300 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-14 14:57:40,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 135 transitions, 1274 flow
[2024-06-14 14:57:40,300 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 14:57:40,300 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:40,300 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:40,300 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:57:40,300 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-14 14:57:40,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:40,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 959840744, now seen corresponding path program 1 times
[2024-06-14 14:57:40,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:40,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487893812]
[2024-06-14 14:57:40,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:40,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:40,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:50,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:50,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:50,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487893812]
[2024-06-14 14:57:50,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487893812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:50,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:50,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:57:50,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926406687]
[2024-06-14 14:57:50,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:50,547 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:57:50,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:50,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:57:50,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:57:50,784 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:50,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 135 transitions, 1274 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:50,785 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:50,785 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:50,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:52,035 INFO  L124   PetriNetUnfolderBase]: 2085/3151 cut-off events.
[2024-06-14 14:57:52,035 INFO  L125   PetriNetUnfolderBase]: For 69311/69362 co-relation queries the response was YES.
[2024-06-14 14:57:52,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19290 conditions, 3151 events. 2085/3151 cut-off events. For 69311/69362 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15027 event pairs, 452 based on Foata normal form. 15/3146 useless extension candidates. Maximal degree in co-relation 19237. Up to 2758 conditions per place. 
[2024-06-14 14:57:52,056 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 119 selfloop transitions, 32 changer transitions 0/172 dead transitions.
[2024-06-14 14:57:52,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 172 transitions, 1838 flow
[2024-06-14 14:57:52,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:57:52,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:57:52,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 14:57:52,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-14 14:57:52,058 INFO  L175             Difference]: Start difference. First operand has 110 places, 135 transitions, 1274 flow. Second operand 8 states and 153 transitions.
[2024-06-14 14:57:52,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 172 transitions, 1838 flow
[2024-06-14 14:57:52,095 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 172 transitions, 1800 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 14:57:52,098 INFO  L231             Difference]: Finished difference. Result has 114 places, 139 transitions, 1411 flow
[2024-06-14 14:57:52,098 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1411, PETRI_PLACES=114, PETRI_TRANSITIONS=139}
[2024-06-14 14:57:52,099 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places.
[2024-06-14 14:57:52,099 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 1411 flow
[2024-06-14 14:57:52,099 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:52,099 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:52,099 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:52,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:57:52,100 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-14 14:57:52,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:52,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -1294086404, now seen corresponding path program 1 times
[2024-06-14 14:57:52,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:52,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009175519]
[2024-06-14 14:57:52,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:52,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:52,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:02,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:02,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:02,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009175519]
[2024-06-14 14:58:02,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009175519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:02,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:02,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:58:02,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809900372]
[2024-06-14 14:58:02,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:02,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:58:02,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:02,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:58:02,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:58:02,414 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:02,414 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 1411 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:02,414 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:02,414 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:02,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:04,083 INFO  L124   PetriNetUnfolderBase]: 2307/3410 cut-off events.
[2024-06-14 14:58:04,084 INFO  L125   PetriNetUnfolderBase]: For 80576/80582 co-relation queries the response was YES.
[2024-06-14 14:58:04,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21424 conditions, 3410 events. 2307/3410 cut-off events. For 80576/80582 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15881 event pairs, 550 based on Foata normal form. 8/3417 useless extension candidates. Maximal degree in co-relation 21370. Up to 2735 conditions per place. 
[2024-06-14 14:58:04,102 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 132 selfloop transitions, 67 changer transitions 0/202 dead transitions.
[2024-06-14 14:58:04,102 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 202 transitions, 2397 flow
[2024-06-14 14:58:04,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:58:04,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:04,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-14 14:58:04,104 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738095238095238
[2024-06-14 14:58:04,104 INFO  L175             Difference]: Start difference. First operand has 114 places, 139 transitions, 1411 flow. Second operand 10 states and 199 transitions.
[2024-06-14 14:58:04,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 202 transitions, 2397 flow
[2024-06-14 14:58:04,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 202 transitions, 2305 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-14 14:58:04,160 INFO  L231             Difference]: Finished difference. Result has 122 places, 151 transitions, 1645 flow
[2024-06-14 14:58:04,160 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1645, PETRI_PLACES=122, PETRI_TRANSITIONS=151}
[2024-06-14 14:58:04,161 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places.
[2024-06-14 14:58:04,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 1645 flow
[2024-06-14 14:58:04,161 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:04,161 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:04,161 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:04,161 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:58:04,161 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:04,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:04,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -1294086528, now seen corresponding path program 2 times
[2024-06-14 14:58:04,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:04,162 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483830286]
[2024-06-14 14:58:04,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:04,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:04,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:14,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:14,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:14,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483830286]
[2024-06-14 14:58:14,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483830286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:14,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:14,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:58:14,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700146980]
[2024-06-14 14:58:14,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:14,966 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:58:14,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:14,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:58:14,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:58:15,148 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:15,148 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 1645 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:15,148 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:15,148 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:15,148 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:16,477 INFO  L124   PetriNetUnfolderBase]: 2212/3323 cut-off events.
[2024-06-14 14:58:16,477 INFO  L125   PetriNetUnfolderBase]: For 87685/87736 co-relation queries the response was YES.
[2024-06-14 14:58:16,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21951 conditions, 3323 events. 2212/3323 cut-off events. For 87685/87736 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15898 event pairs, 576 based on Foata normal form. 15/3318 useless extension candidates. Maximal degree in co-relation 21893. Up to 2997 conditions per place. 
[2024-06-14 14:58:16,501 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 131 selfloop transitions, 28 changer transitions 0/183 dead transitions.
[2024-06-14 14:58:16,501 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 183 transitions, 2077 flow
[2024-06-14 14:58:16,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:58:16,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:58:16,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 14:58:16,504 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-14 14:58:16,504 INFO  L175             Difference]: Start difference. First operand has 122 places, 151 transitions, 1645 flow. Second operand 8 states and 150 transitions.
[2024-06-14 14:58:16,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 183 transitions, 2077 flow
[2024-06-14 14:58:16,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1932 flow, removed 40 selfloop flow, removed 5 redundant places.
[2024-06-14 14:58:16,627 INFO  L231             Difference]: Finished difference. Result has 125 places, 153 transitions, 1605 flow
[2024-06-14 14:58:16,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1605, PETRI_PLACES=125, PETRI_TRANSITIONS=153}
[2024-06-14 14:58:16,627 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-14 14:58:16,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 153 transitions, 1605 flow
[2024-06-14 14:58:16,627 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:16,627 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:16,628 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:16,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:58:16,628 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-14 14:58:16,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:16,629 INFO  L85        PathProgramCache]: Analyzing trace with hash 1073520224, now seen corresponding path program 3 times
[2024-06-14 14:58:16,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:16,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037037602]
[2024-06-14 14:58:16,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:16,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:16,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:26,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:26,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:26,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037037602]
[2024-06-14 14:58:26,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037037602] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:26,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:26,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:58:26,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177939061]
[2024-06-14 14:58:26,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:26,815 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:58:26,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:26,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:58:26,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:58:27,043 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:27,044 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 153 transitions, 1605 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:27,044 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:27,044 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:27,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:28,418 INFO  L124   PetriNetUnfolderBase]: 2204/3311 cut-off events.
[2024-06-14 14:58:28,418 INFO  L125   PetriNetUnfolderBase]: For 91308/91359 co-relation queries the response was YES.
[2024-06-14 14:58:28,427 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21896 conditions, 3311 events. 2204/3311 cut-off events. For 91308/91359 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15826 event pairs, 574 based on Foata normal form. 15/3306 useless extension candidates. Maximal degree in co-relation 21836. Up to 3018 conditions per place. 
[2024-06-14 14:58:28,439 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 132 selfloop transitions, 24 changer transitions 0/180 dead transitions.
[2024-06-14 14:58:28,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 180 transitions, 1985 flow
[2024-06-14 14:58:28,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:58:28,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:58:28,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 14:58:28,442 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-14 14:58:28,442 INFO  L175             Difference]: Start difference. First operand has 125 places, 153 transitions, 1605 flow. Second operand 8 states and 147 transitions.
[2024-06-14 14:58:28,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 180 transitions, 1985 flow
[2024-06-14 14:58:28,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 180 transitions, 1876 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-14 14:58:28,508 INFO  L231             Difference]: Finished difference. Result has 127 places, 153 transitions, 1551 flow
[2024-06-14 14:58:28,509 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1551, PETRI_PLACES=127, PETRI_TRANSITIONS=153}
[2024-06-14 14:58:28,509 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-14 14:58:28,509 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 153 transitions, 1551 flow
[2024-06-14 14:58:28,509 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:28,509 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:28,510 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:28,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:58:28,510 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-14 14:58:28,510 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:28,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077988998, now seen corresponding path program 2 times
[2024-06-14 14:58:28,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:28,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077889233]
[2024-06-14 14:58:28,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:28,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:28,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:39,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:39,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:39,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077889233]
[2024-06-14 14:58:39,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077889233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:39,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:39,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:58:39,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445761301]
[2024-06-14 14:58:39,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:39,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:58:39,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:39,100 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:58:39,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:58:39,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:39,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 153 transitions, 1551 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:39,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:39,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:39,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:40,803 INFO  L124   PetriNetUnfolderBase]: 2352/3477 cut-off events.
[2024-06-14 14:58:40,803 INFO  L125   PetriNetUnfolderBase]: For 100734/100740 co-relation queries the response was YES.
[2024-06-14 14:58:40,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23166 conditions, 3477 events. 2352/3477 cut-off events. For 100734/100740 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16245 event pairs, 536 based on Foata normal form. 8/3484 useless extension candidates. Maximal degree in co-relation 23105. Up to 2874 conditions per place. 
[2024-06-14 14:58:40,827 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 135 selfloop transitions, 62 changer transitions 0/200 dead transitions.
[2024-06-14 14:58:40,828 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 200 transitions, 2418 flow
[2024-06-14 14:58:40,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:58:40,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:58:40,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-14 14:58:40,829 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-06-14 14:58:40,829 INFO  L175             Difference]: Start difference. First operand has 127 places, 153 transitions, 1551 flow. Second operand 8 states and 165 transitions.
[2024-06-14 14:58:40,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 200 transitions, 2418 flow
[2024-06-14 14:58:40,894 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 200 transitions, 2355 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-14 14:58:40,897 INFO  L231             Difference]: Finished difference. Result has 129 places, 158 transitions, 1723 flow
[2024-06-14 14:58:40,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1723, PETRI_PLACES=129, PETRI_TRANSITIONS=158}
[2024-06-14 14:58:40,897 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-14 14:58:40,898 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 158 transitions, 1723 flow
[2024-06-14 14:58:40,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:40,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:40,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:40,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:58:40,898 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-14 14:58:40,898 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:40,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077993648, now seen corresponding path program 3 times
[2024-06-14 14:58:40,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:40,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870018943]
[2024-06-14 14:58:40,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:40,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:40,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:51,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:51,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:51,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870018943]
[2024-06-14 14:58:51,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870018943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:51,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:51,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:58:51,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738239496]
[2024-06-14 14:58:51,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:51,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:58:51,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:51,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:58:51,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:58:51,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:51,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 158 transitions, 1723 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:51,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:51,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:51,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:52,985 INFO  L124   PetriNetUnfolderBase]: 2388/3529 cut-off events.
[2024-06-14 14:58:52,985 INFO  L125   PetriNetUnfolderBase]: For 110717/110723 co-relation queries the response was YES.
[2024-06-14 14:58:52,994 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24402 conditions, 3529 events. 2388/3529 cut-off events. For 110717/110723 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16527 event pairs, 537 based on Foata normal form. 8/3536 useless extension candidates. Maximal degree in co-relation 24339. Up to 3046 conditions per place. 
[2024-06-14 14:58:53,004 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 138 selfloop transitions, 57 changer transitions 0/198 dead transitions.
[2024-06-14 14:58:53,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 198 transitions, 2437 flow
[2024-06-14 14:58:53,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:58:53,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:58:53,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-14 14:58:53,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47023809523809523
[2024-06-14 14:58:53,005 INFO  L175             Difference]: Start difference. First operand has 129 places, 158 transitions, 1723 flow. Second operand 8 states and 158 transitions.
[2024-06-14 14:58:53,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 198 transitions, 2437 flow
[2024-06-14 14:58:53,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 2259 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-14 14:58:53,080 INFO  L231             Difference]: Finished difference. Result has 131 places, 162 transitions, 1748 flow
[2024-06-14 14:58:53,080 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1748, PETRI_PLACES=131, PETRI_TRANSITIONS=162}
[2024-06-14 14:58:53,080 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-14 14:58:53,081 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 162 transitions, 1748 flow
[2024-06-14 14:58:53,081 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:53,081 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:53,081 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:53,081 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:58:53,081 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-14 14:58:53,081 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:53,081 INFO  L85        PathProgramCache]: Analyzing trace with hash 1078173572, now seen corresponding path program 1 times
[2024-06-14 14:58:53,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:53,082 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278066596]
[2024-06-14 14:58:53,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:53,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:53,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:03,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:03,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:03,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278066596]
[2024-06-14 14:59:03,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278066596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:03,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:03,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:03,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149011673]
[2024-06-14 14:59:03,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:03,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:03,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:03,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:03,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:03,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:03,870 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 162 transitions, 1748 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:03,870 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:03,870 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:03,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:05,325 INFO  L124   PetriNetUnfolderBase]: 2444/3617 cut-off events.
[2024-06-14 14:59:05,326 INFO  L125   PetriNetUnfolderBase]: For 122105/122111 co-relation queries the response was YES.
[2024-06-14 14:59:05,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25105 conditions, 3617 events. 2444/3617 cut-off events. For 122105/122111 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17025 event pairs, 555 based on Foata normal form. 14/3630 useless extension candidates. Maximal degree in co-relation 25041. Up to 3116 conditions per place. 
[2024-06-14 14:59:05,349 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 143 selfloop transitions, 53 changer transitions 0/199 dead transitions.
[2024-06-14 14:59:05,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 199 transitions, 2460 flow
[2024-06-14 14:59:05,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:59:05,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:59:05,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-14 14:59:05,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 14:59:05,350 INFO  L175             Difference]: Start difference. First operand has 131 places, 162 transitions, 1748 flow. Second operand 8 states and 156 transitions.
[2024-06-14 14:59:05,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 199 transitions, 2460 flow
[2024-06-14 14:59:05,435 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 199 transitions, 2305 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-14 14:59:05,437 INFO  L231             Difference]: Finished difference. Result has 133 places, 166 transitions, 1788 flow
[2024-06-14 14:59:05,438 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1788, PETRI_PLACES=133, PETRI_TRANSITIONS=166}
[2024-06-14 14:59:05,438 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-14 14:59:05,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 166 transitions, 1788 flow
[2024-06-14 14:59:05,439 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:05,439 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:05,439 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:05,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:59:05,439 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-14 14:59:05,440 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:05,440 INFO  L85        PathProgramCache]: Analyzing trace with hash -147109192, now seen corresponding path program 4 times
[2024-06-14 14:59:05,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:05,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682970465]
[2024-06-14 14:59:05,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:05,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:05,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:13,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:13,661 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:13,661 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682970465]
[2024-06-14 14:59:13,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682970465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:13,661 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:13,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:59:13,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907394138]
[2024-06-14 14:59:13,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:13,662 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:59:13,662 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:13,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:59:13,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:59:13,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:13,851 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 166 transitions, 1788 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:13,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:13,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:13,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:15,388 INFO  L124   PetriNetUnfolderBase]: 2480/3669 cut-off events.
[2024-06-14 14:59:15,389 INFO  L125   PetriNetUnfolderBase]: For 127742/127748 co-relation queries the response was YES.
[2024-06-14 14:59:15,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26015 conditions, 3669 events. 2480/3669 cut-off events. For 127742/127748 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17333 event pairs, 521 based on Foata normal form. 8/3676 useless extension candidates. Maximal degree in co-relation 25950. Up to 3124 conditions per place. 
[2024-06-14 14:59:15,415 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 141 selfloop transitions, 64 changer transitions 0/208 dead transitions.
[2024-06-14 14:59:15,415 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 208 transitions, 2616 flow
[2024-06-14 14:59:15,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:59:15,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:59:15,416 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:59:15,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-14 14:59:15,417 INFO  L175             Difference]: Start difference. First operand has 133 places, 166 transitions, 1788 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:59:15,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 208 transitions, 2616 flow
[2024-06-14 14:59:15,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 208 transitions, 2451 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-14 14:59:15,504 INFO  L231             Difference]: Finished difference. Result has 136 places, 173 transitions, 1920 flow
[2024-06-14 14:59:15,504 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1920, PETRI_PLACES=136, PETRI_TRANSITIONS=173}
[2024-06-14 14:59:15,505 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-14 14:59:15,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 173 transitions, 1920 flow
[2024-06-14 14:59:15,505 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:15,505 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:15,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:15,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:59:15,506 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:15,506 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:15,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -223694098, now seen corresponding path program 1 times
[2024-06-14 14:59:15,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:15,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173221402]
[2024-06-14 14:59:15,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:15,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:15,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:26,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:26,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:26,714 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173221402]
[2024-06-14 14:59:26,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173221402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:26,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:26,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:59:26,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793931548]
[2024-06-14 14:59:26,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:26,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:59:26,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:26,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:59:26,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:59:26,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:26,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 173 transitions, 1920 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 14:59:26,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:26,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:26,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:28,091 INFO  L124   PetriNetUnfolderBase]: 2485/3675 cut-off events.
[2024-06-14 14:59:28,092 INFO  L125   PetriNetUnfolderBase]: For 134044/134044 co-relation queries the response was YES.
[2024-06-14 14:59:28,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26701 conditions, 3675 events. 2485/3675 cut-off events. For 134044/134044 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17295 event pairs, 634 based on Foata normal form. 1/3675 useless extension candidates. Maximal degree in co-relation 26634. Up to 3637 conditions per place. 
[2024-06-14 14:59:28,115 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 173 selfloop transitions, 16 changer transitions 0/192 dead transitions.
[2024-06-14 14:59:28,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 192 transitions, 2444 flow
[2024-06-14 14:59:28,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:59:28,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:59:28,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-14 14:59:28,116 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-14 14:59:28,116 INFO  L175             Difference]: Start difference. First operand has 136 places, 173 transitions, 1920 flow. Second operand 6 states and 105 transitions.
[2024-06-14 14:59:28,116 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 192 transitions, 2444 flow
[2024-06-14 14:59:28,202 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 192 transitions, 2298 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-14 14:59:28,204 INFO  L231             Difference]: Finished difference. Result has 137 places, 176 transitions, 1860 flow
[2024-06-14 14:59:28,205 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=137, PETRI_TRANSITIONS=176}
[2024-06-14 14:59:28,205 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places.
[2024-06-14 14:59:28,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 176 transitions, 1860 flow
[2024-06-14 14:59:28,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 14:59:28,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:28,206 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:28,206 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:59:28,206 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-14 14:59:28,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:28,206 INFO  L85        PathProgramCache]: Analyzing trace with hash -1741122390, now seen corresponding path program 2 times
[2024-06-14 14:59:28,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:28,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774156033]
[2024-06-14 14:59:28,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:28,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:28,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:37,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:37,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:37,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774156033]
[2024-06-14 14:59:37,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774156033] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:37,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:37,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:59:37,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132909976]
[2024-06-14 14:59:37,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:37,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:59:37,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:37,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:59:37,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:59:37,176 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:37,176 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 176 transitions, 1860 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:37,176 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:37,176 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:37,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:38,807 INFO  L124   PetriNetUnfolderBase]: 2513/3719 cut-off events.
[2024-06-14 14:59:38,807 INFO  L125   PetriNetUnfolderBase]: For 143928/143928 co-relation queries the response was YES.
[2024-06-14 14:59:38,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26741 conditions, 3719 events. 2513/3719 cut-off events. For 143928/143928 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17601 event pairs, 624 based on Foata normal form. 6/3724 useless extension candidates. Maximal degree in co-relation 26673. Up to 3619 conditions per place. 
[2024-06-14 14:59:38,835 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 178 selfloop transitions, 24 changer transitions 0/205 dead transitions.
[2024-06-14 14:59:38,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 205 transitions, 2466 flow
[2024-06-14 14:59:38,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:59:38,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:59:38,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-14 14:59:38,836 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-14 14:59:38,836 INFO  L175             Difference]: Start difference. First operand has 137 places, 176 transitions, 1860 flow. Second operand 8 states and 141 transitions.
[2024-06-14 14:59:38,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 205 transitions, 2466 flow
[2024-06-14 14:59:38,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 205 transitions, 2348 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 14:59:38,941 INFO  L231             Difference]: Finished difference. Result has 140 places, 179 transitions, 1880 flow
[2024-06-14 14:59:38,942 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1880, PETRI_PLACES=140, PETRI_TRANSITIONS=179}
[2024-06-14 14:59:38,942 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-14 14:59:38,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 179 transitions, 1880 flow
[2024-06-14 14:59:38,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:38,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:38,942 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:38,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:59:38,943 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-14 14:59:38,943 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:38,943 INFO  L85        PathProgramCache]: Analyzing trace with hash 18536886, now seen corresponding path program 3 times
[2024-06-14 14:59:38,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:38,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826880953]
[2024-06-14 14:59:38,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:38,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:39,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:48,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:48,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:48,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826880953]
[2024-06-14 14:59:48,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826880953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:48,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:48,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:59:48,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287839739]
[2024-06-14 14:59:48,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:48,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:59:48,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:48,623 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:59:48,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:59:48,749 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:48,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 179 transitions, 1880 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:48,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:48,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:48,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:50,342 INFO  L124   PetriNetUnfolderBase]: 2541/3763 cut-off events.
[2024-06-14 14:59:50,342 INFO  L125   PetriNetUnfolderBase]: For 153516/153516 co-relation queries the response was YES.
[2024-06-14 14:59:50,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27573 conditions, 3763 events. 2541/3763 cut-off events. For 153516/153516 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17875 event pairs, 621 based on Foata normal form. 6/3768 useless extension candidates. Maximal degree in co-relation 27504. Up to 3603 conditions per place. 
[2024-06-14 14:59:50,365 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 177 selfloop transitions, 30 changer transitions 0/210 dead transitions.
[2024-06-14 14:59:50,365 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 210 transitions, 2572 flow
[2024-06-14 14:59:50,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:59:50,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:59:50,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 14:59:50,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:59:50,366 INFO  L175             Difference]: Start difference. First operand has 140 places, 179 transitions, 1880 flow. Second operand 8 states and 144 transitions.
[2024-06-14 14:59:50,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 210 transitions, 2572 flow
[2024-06-14 14:59:50,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 210 transitions, 2458 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-14 14:59:50,470 INFO  L231             Difference]: Finished difference. Result has 142 places, 182 transitions, 1922 flow
[2024-06-14 14:59:50,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1922, PETRI_PLACES=142, PETRI_TRANSITIONS=182}
[2024-06-14 14:59:50,470 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places.
[2024-06-14 14:59:50,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 182 transitions, 1922 flow
[2024-06-14 14:59:50,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:50,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:50,471 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:50,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:59:50,471 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-14 14:59:50,471 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:50,471 INFO  L85        PathProgramCache]: Analyzing trace with hash 830245694, now seen corresponding path program 4 times
[2024-06-14 14:59:50,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:50,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132430906]
[2024-06-14 14:59:50,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:50,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:50,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:59,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:59,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:59,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132430906]
[2024-06-14 14:59:59,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132430906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:59,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:59,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:59,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121774881]
[2024-06-14 14:59:59,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:59,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:59,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:59,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:59,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:59,695 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:59,695 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 182 transitions, 1922 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:59,695 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:59,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:59,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:01,317 INFO  L124   PetriNetUnfolderBase]: 2569/3807 cut-off events.
[2024-06-14 15:00:01,317 INFO  L125   PetriNetUnfolderBase]: For 163502/163502 co-relation queries the response was YES.
[2024-06-14 15:00:01,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28296 conditions, 3807 events. 2569/3807 cut-off events. For 163502/163502 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18135 event pairs, 626 based on Foata normal form. 6/3812 useless extension candidates. Maximal degree in co-relation 28226. Up to 3648 conditions per place. 
[2024-06-14 15:00:01,347 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 36 changer transitions 0/211 dead transitions.
[2024-06-14 15:00:01,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 211 transitions, 2556 flow
[2024-06-14 15:00:01,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:00:01,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:00:01,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 15:00:01,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-14 15:00:01,349 INFO  L175             Difference]: Start difference. First operand has 142 places, 182 transitions, 1922 flow. Second operand 8 states and 143 transitions.
[2024-06-14 15:00:01,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 211 transitions, 2556 flow
[2024-06-14 15:00:01,461 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 211 transitions, 2424 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:01,464 INFO  L231             Difference]: Finished difference. Result has 144 places, 185 transitions, 1968 flow
[2024-06-14 15:00:01,464 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1968, PETRI_PLACES=144, PETRI_TRANSITIONS=185}
[2024-06-14 15:00:01,464 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-14 15:00:01,464 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 1968 flow
[2024-06-14 15:00:01,464 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:01,465 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:01,465 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:01,465 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 15:00:01,465 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-14 15:00:01,465 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:01,465 INFO  L85        PathProgramCache]: Analyzing trace with hash 830245446, now seen corresponding path program 1 times
[2024-06-14 15:00:01,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:01,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547189300]
[2024-06-14 15:00:01,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:01,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:01,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:10,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:10,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:10,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547189300]
[2024-06-14 15:00:10,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547189300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:10,405 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:10,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:00:10,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206828269]
[2024-06-14 15:00:10,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:10,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:00:10,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:10,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:00:10,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:00:10,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:10,556 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 185 transitions, 1968 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:10,556 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:10,556 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:10,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:12,019 INFO  L124   PetriNetUnfolderBase]: 2571/3811 cut-off events.
[2024-06-14 15:00:12,019 INFO  L125   PetriNetUnfolderBase]: For 169302/169308 co-relation queries the response was YES.
[2024-06-14 15:00:12,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28541 conditions, 3811 events. 2571/3811 cut-off events. For 169302/169308 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18158 event pairs, 622 based on Foata normal form. 9/3819 useless extension candidates. Maximal degree in co-relation 28470. Up to 3656 conditions per place. 
[2024-06-14 15:00:12,046 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 36 changer transitions 0/211 dead transitions.
[2024-06-14 15:00:12,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 2592 flow
[2024-06-14 15:00:12,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:00:12,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:00:12,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 15:00:12,047 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4387755102040816
[2024-06-14 15:00:12,047 INFO  L175             Difference]: Start difference. First operand has 144 places, 185 transitions, 1968 flow. Second operand 7 states and 129 transitions.
[2024-06-14 15:00:12,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 2592 flow
[2024-06-14 15:00:12,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 211 transitions, 2438 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:12,169 INFO  L231             Difference]: Finished difference. Result has 145 places, 189 transitions, 1994 flow
[2024-06-14 15:00:12,169 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1994, PETRI_PLACES=145, PETRI_TRANSITIONS=189}
[2024-06-14 15:00:12,169 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-14 15:00:12,170 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 189 transitions, 1994 flow
[2024-06-14 15:00:12,170 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:12,170 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:12,170 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:12,170 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 15:00:12,170 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-14 15:00:12,171 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:12,171 INFO  L85        PathProgramCache]: Analyzing trace with hash -88644192, now seen corresponding path program 5 times
[2024-06-14 15:00:12,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:12,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499467853]
[2024-06-14 15:00:12,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:12,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:12,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:21,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:21,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:21,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499467853]
[2024-06-14 15:00:21,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499467853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:21,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:21,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:00:21,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469983617]
[2024-06-14 15:00:21,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:21,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:00:21,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:21,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:00:21,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:00:22,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:22,027 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 189 transitions, 1994 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:22,027 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:22,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:22,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:23,497 INFO  L124   PetriNetUnfolderBase]: 2575/3817 cut-off events.
[2024-06-14 15:00:23,497 INFO  L125   PetriNetUnfolderBase]: For 165875/165881 co-relation queries the response was YES.
[2024-06-14 15:00:23,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28083 conditions, 3817 events. 2575/3817 cut-off events. For 165875/165881 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18200 event pairs, 622 based on Foata normal form. 12/3828 useless extension candidates. Maximal degree in co-relation 28011. Up to 3674 conditions per place. 
[2024-06-14 15:00:23,528 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 190 selfloop transitions, 27 changer transitions 0/220 dead transitions.
[2024-06-14 15:00:23,528 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 220 transitions, 2656 flow
[2024-06-14 15:00:23,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:00:23,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:00:23,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:00:23,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 15:00:23,529 INFO  L175             Difference]: Start difference. First operand has 145 places, 189 transitions, 1994 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:00:23,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 220 transitions, 2656 flow
[2024-06-14 15:00:23,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 220 transitions, 2538 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-14 15:00:23,663 INFO  L231             Difference]: Finished difference. Result has 148 places, 193 transitions, 2037 flow
[2024-06-14 15:00:23,663 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1876, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2037, PETRI_PLACES=148, PETRI_TRANSITIONS=193}
[2024-06-14 15:00:23,663 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places.
[2024-06-14 15:00:23,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 193 transitions, 2037 flow
[2024-06-14 15:00:23,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:23,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:23,664 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:23,664 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 15:00:23,664 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-14 15:00:23,664 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:23,664 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693425448, now seen corresponding path program 5 times
[2024-06-14 15:00:23,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:23,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676987492]
[2024-06-14 15:00:23,664 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:23,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:23,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:32,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:32,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:32,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676987492]
[2024-06-14 15:00:32,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676987492] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:32,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:32,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:32,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045805222]
[2024-06-14 15:00:32,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:32,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:32,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:32,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:32,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:32,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:32,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 193 transitions, 2037 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:32,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:32,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:32,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:33,826 INFO  L124   PetriNetUnfolderBase]: 2578/3821 cut-off events.
[2024-06-14 15:00:33,826 INFO  L125   PetriNetUnfolderBase]: For 173156/173156 co-relation queries the response was YES.
[2024-06-14 15:00:33,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28265 conditions, 3821 events. 2578/3821 cut-off events. For 173156/173156 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18223 event pairs, 606 based on Foata normal form. 6/3826 useless extension candidates. Maximal degree in co-relation 28192. Up to 3693 conditions per place. 
[2024-06-14 15:00:33,852 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 191 selfloop transitions, 28 changer transitions 0/222 dead transitions.
[2024-06-14 15:00:33,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 222 transitions, 2699 flow
[2024-06-14 15:00:33,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:00:33,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:00:33,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 15:00:33,853 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 15:00:33,854 INFO  L175             Difference]: Start difference. First operand has 148 places, 193 transitions, 2037 flow. Second operand 8 states and 142 transitions.
[2024-06-14 15:00:33,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 222 transitions, 2699 flow
[2024-06-14 15:00:33,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 222 transitions, 2580 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:33,970 INFO  L231             Difference]: Finished difference. Result has 150 places, 196 transitions, 2080 flow
[2024-06-14 15:00:33,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2080, PETRI_PLACES=150, PETRI_TRANSITIONS=196}
[2024-06-14 15:00:33,970 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-14 15:00:33,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 196 transitions, 2080 flow
[2024-06-14 15:00:33,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:33,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:33,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:33,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 15:00:33,971 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:33,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:33,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 1191062822, now seen corresponding path program 2 times
[2024-06-14 15:00:33,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:33,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734527658]
[2024-06-14 15:00:33,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:33,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:34,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:44,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:44,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:44,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734527658]
[2024-06-14 15:00:44,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734527658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:44,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:44,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:00:44,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393760622]
[2024-06-14 15:00:44,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:44,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:00:44,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:44,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:00:44,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:00:44,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:44,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 196 transitions, 2080 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:00:44,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:44,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:44,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:45,506 INFO  L124   PetriNetUnfolderBase]: 2575/3817 cut-off events.
[2024-06-14 15:00:45,506 INFO  L125   PetriNetUnfolderBase]: For 176758/176758 co-relation queries the response was YES.
[2024-06-14 15:00:45,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28467 conditions, 3817 events. 2575/3817 cut-off events. For 176758/176758 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18178 event pairs, 634 based on Foata normal form. 1/3817 useless extension candidates. Maximal degree in co-relation 28393. Up to 3798 conditions per place. 
[2024-06-14 15:00:45,535 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 191 selfloop transitions, 11 changer transitions 0/205 dead transitions.
[2024-06-14 15:00:45,535 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 205 transitions, 2506 flow
[2024-06-14 15:00:45,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:00:45,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:00:45,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 15:00:45,536 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-14 15:00:45,536 INFO  L175             Difference]: Start difference. First operand has 150 places, 196 transitions, 2080 flow. Second operand 6 states and 96 transitions.
[2024-06-14 15:00:45,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 205 transitions, 2506 flow
[2024-06-14 15:00:45,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 205 transitions, 2356 flow, removed 49 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:45,673 INFO  L231             Difference]: Finished difference. Result has 150 places, 196 transitions, 1958 flow
[2024-06-14 15:00:45,673 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1958, PETRI_PLACES=150, PETRI_TRANSITIONS=196}
[2024-06-14 15:00:45,673 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-14 15:00:45,673 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 196 transitions, 1958 flow
[2024-06-14 15:00:45,673 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:00:45,674 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:45,674 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:45,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 15:00:45,674 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:45,674 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:45,674 INFO  L85        PathProgramCache]: Analyzing trace with hash -217974226, now seen corresponding path program 1 times
[2024-06-14 15:00:45,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:45,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562529846]
[2024-06-14 15:00:45,675 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:45,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:45,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:58,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:58,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:58,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562529846]
[2024-06-14 15:00:58,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562529846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:58,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:58,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:00:58,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132101559]
[2024-06-14 15:00:58,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:58,779 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:00:58,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:58,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:00:58,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:00:58,904 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:58,904 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 196 transitions, 1958 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:00:58,904 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:58,904 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:58,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:00,371 INFO  L124   PetriNetUnfolderBase]: 2574/3816 cut-off events.
[2024-06-14 15:01:00,372 INFO  L125   PetriNetUnfolderBase]: For 182468/182468 co-relation queries the response was YES.
[2024-06-14 15:01:00,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28240 conditions, 3816 events. 2574/3816 cut-off events. For 182468/182468 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18146 event pairs, 632 based on Foata normal form. 3/3818 useless extension candidates. Maximal degree in co-relation 28165. Up to 3748 conditions per place. 
[2024-06-14 15:01:00,397 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 185 selfloop transitions, 24 changer transitions 0/212 dead transitions.
[2024-06-14 15:01:00,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 212 transitions, 2523 flow
[2024-06-14 15:01:00,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:01:00,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:01:00,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 15:01:00,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-14 15:01:00,399 INFO  L175             Difference]: Start difference. First operand has 150 places, 196 transitions, 1958 flow. Second operand 6 states and 106 transitions.
[2024-06-14 15:01:00,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 212 transitions, 2523 flow
[2024-06-14 15:01:00,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 212 transitions, 2491 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-14 15:01:00,513 INFO  L231             Difference]: Finished difference. Result has 151 places, 199 transitions, 2030 flow
[2024-06-14 15:01:00,513 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2030, PETRI_PLACES=151, PETRI_TRANSITIONS=199}
[2024-06-14 15:01:00,513 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places.
[2024-06-14 15:01:00,513 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 199 transitions, 2030 flow
[2024-06-14 15:01:00,513 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:01:00,513 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:00,514 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:00,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 15:01:00,514 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:00,514 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:00,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190002064, now seen corresponding path program 2 times
[2024-06-14 15:01:00,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:00,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707705260]
[2024-06-14 15:01:00,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:00,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:00,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:13,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:13,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:13,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707705260]
[2024-06-14 15:01:13,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707705260] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:13,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:13,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:01:13,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112712768]
[2024-06-14 15:01:13,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:13,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:01:13,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:13,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:01:13,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:01:13,751 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:01:13,752 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 199 transitions, 2030 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:01:13,752 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:13,752 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:01:13,752 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:15,176 INFO  L124   PetriNetUnfolderBase]: 2539/3763 cut-off events.
[2024-06-14 15:01:15,176 INFO  L125   PetriNetUnfolderBase]: For 188935/188941 co-relation queries the response was YES.
[2024-06-14 15:01:15,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28178 conditions, 3763 events. 2539/3763 cut-off events. For 188935/188941 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17850 event pairs, 642 based on Foata normal form. 3/3765 useless extension candidates. Maximal degree in co-relation 28102. Up to 3697 conditions per place. 
[2024-06-14 15:01:15,202 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 180 selfloop transitions, 25 changer transitions 0/208 dead transitions.
[2024-06-14 15:01:15,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 208 transitions, 2462 flow
[2024-06-14 15:01:15,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:01:15,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:01:15,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-14 15:01:15,203 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-14 15:01:15,203 INFO  L175             Difference]: Start difference. First operand has 151 places, 199 transitions, 2030 flow. Second operand 6 states and 103 transitions.
[2024-06-14 15:01:15,203 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 208 transitions, 2462 flow
[2024-06-14 15:01:15,338 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 208 transitions, 2402 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 15:01:15,341 INFO  L231             Difference]: Finished difference. Result has 153 places, 199 transitions, 2026 flow
[2024-06-14 15:01:15,341 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2026, PETRI_PLACES=153, PETRI_TRANSITIONS=199}
[2024-06-14 15:01:15,341 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-14 15:01:15,342 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 199 transitions, 2026 flow
[2024-06-14 15:01:15,342 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:01:15,342 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:15,342 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:15,342 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 15:01:15,342 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-14 15:01:15,342 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:15,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -309706496, now seen corresponding path program 1 times
[2024-06-14 15:01:15,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:15,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24713171]
[2024-06-14 15:01:15,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:15,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:15,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:25,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:25,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:25,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24713171]
[2024-06-14 15:01:25,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24713171] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:25,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:25,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:25,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480685443]
[2024-06-14 15:01:25,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:25,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:25,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:25,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:25,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:26,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:01:26,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 199 transitions, 2026 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:26,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:26,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:01:26,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:27,957 INFO  L124   PetriNetUnfolderBase]: 2826/4224 cut-off events.
[2024-06-14 15:01:27,957 INFO  L125   PetriNetUnfolderBase]: For 240013/240019 co-relation queries the response was YES.
[2024-06-14 15:01:27,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32773 conditions, 4224 events. 2826/4224 cut-off events. For 240013/240019 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20952 event pairs, 433 based on Foata normal form. 26/4249 useless extension candidates. Maximal degree in co-relation 32696. Up to 2720 conditions per place. 
[2024-06-14 15:01:27,987 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 183 selfloop transitions, 74 changer transitions 0/260 dead transitions.
[2024-06-14 15:01:27,988 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 260 transitions, 3320 flow
[2024-06-14 15:01:27,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:01:27,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:01:27,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-14 15:01:27,989 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48677248677248675
[2024-06-14 15:01:27,989 INFO  L175             Difference]: Start difference. First operand has 153 places, 199 transitions, 2026 flow. Second operand 9 states and 184 transitions.
[2024-06-14 15:01:27,989 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 260 transitions, 3320 flow
[2024-06-14 15:01:28,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 260 transitions, 3248 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 15:01:28,142 INFO  L231             Difference]: Finished difference. Result has 158 places, 205 transitions, 2308 flow
[2024-06-14 15:01:28,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2308, PETRI_PLACES=158, PETRI_TRANSITIONS=205}
[2024-06-14 15:01:28,143 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-14 15:01:28,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 205 transitions, 2308 flow
[2024-06-14 15:01:28,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:28,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:28,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:28,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 15:01:28,144 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-14 15:01:28,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:28,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -307828826, now seen corresponding path program 2 times
[2024-06-14 15:01:28,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:28,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712483833]
[2024-06-14 15:01:28,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:28,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:28,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:39,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:39,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:39,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712483833]
[2024-06-14 15:01:39,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712483833] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:39,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:39,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:39,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870909238]
[2024-06-14 15:01:39,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:39,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:39,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:39,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:39,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:39,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:01:39,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 205 transitions, 2308 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:39,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:39,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:01:39,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:41,691 INFO  L124   PetriNetUnfolderBase]: 3010/4513 cut-off events.
[2024-06-14 15:01:41,691 INFO  L125   PetriNetUnfolderBase]: For 275347/275353 co-relation queries the response was YES.
[2024-06-14 15:01:41,709 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36022 conditions, 4513 events. 3010/4513 cut-off events. For 275347/275353 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 22917 event pairs, 651 based on Foata normal form. 32/4544 useless extension candidates. Maximal degree in co-relation 35943. Up to 3494 conditions per place. 
[2024-06-14 15:01:41,728 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 169 selfloop transitions, 94 changer transitions 0/266 dead transitions.
[2024-06-14 15:01:41,729 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 266 transitions, 3549 flow
[2024-06-14 15:01:41,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:01:41,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:01:41,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-14 15:01:41,730 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 15:01:41,730 INFO  L175             Difference]: Start difference. First operand has 158 places, 205 transitions, 2308 flow. Second operand 9 states and 180 transitions.
[2024-06-14 15:01:41,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 266 transitions, 3549 flow
[2024-06-14 15:01:41,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 266 transitions, 3380 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-14 15:01:41,946 INFO  L231             Difference]: Finished difference. Result has 166 places, 218 transitions, 2603 flow
[2024-06-14 15:01:41,946 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2603, PETRI_PLACES=166, PETRI_TRANSITIONS=218}
[2024-06-14 15:01:41,946 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-14 15:01:41,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 218 transitions, 2603 flow
[2024-06-14 15:01:41,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:41,947 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:41,947 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:41,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 15:01:41,947 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-14 15:01:41,947 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:41,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -307832546, now seen corresponding path program 3 times
[2024-06-14 15:01:41,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:41,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083500951]
[2024-06-14 15:01:41,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:41,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:42,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:53,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:53,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:53,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083500951]
[2024-06-14 15:01:53,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083500951] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:53,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:53,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:53,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367756554]
[2024-06-14 15:01:53,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:53,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:53,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:53,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:53,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:54,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:01:54,189 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 218 transitions, 2603 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:54,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:54,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:01:54,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:56,284 INFO  L124   PetriNetUnfolderBase]: 3178/4781 cut-off events.
[2024-06-14 15:01:56,285 INFO  L125   PetriNetUnfolderBase]: For 292981/292987 co-relation queries the response was YES.
[2024-06-14 15:01:56,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39641 conditions, 4781 events. 3178/4781 cut-off events. For 292981/292987 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 24797 event pairs, 679 based on Foata normal form. 26/4806 useless extension candidates. Maximal degree in co-relation 39557. Up to 3565 conditions per place. 
[2024-06-14 15:01:56,319 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 188 selfloop transitions, 80 changer transitions 0/271 dead transitions.
[2024-06-14 15:01:56,319 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 271 transitions, 3755 flow
[2024-06-14 15:01:56,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:01:56,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:01:56,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-14 15:01:56,321 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47883597883597884
[2024-06-14 15:01:56,321 INFO  L175             Difference]: Start difference. First operand has 166 places, 218 transitions, 2603 flow. Second operand 9 states and 181 transitions.
[2024-06-14 15:01:56,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 271 transitions, 3755 flow
[2024-06-14 15:01:56,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 271 transitions, 3554 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-14 15:01:56,610 INFO  L231             Difference]: Finished difference. Result has 172 places, 222 transitions, 2724 flow
[2024-06-14 15:01:56,611 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2402, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2724, PETRI_PLACES=172, PETRI_TRANSITIONS=222}
[2024-06-14 15:01:56,611 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-14 15:01:56,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 222 transitions, 2724 flow
[2024-06-14 15:01:56,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:56,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:56,612 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:56,612 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:01:56,612 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-14 15:01:56,612 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:56,612 INFO  L85        PathProgramCache]: Analyzing trace with hash 450162378, now seen corresponding path program 4 times
[2024-06-14 15:01:56,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:56,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873284494]
[2024-06-14 15:01:56,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:56,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:56,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:07,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:07,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:07,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873284494]
[2024-06-14 15:02:07,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873284494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:07,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:07,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:02:07,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251042102]
[2024-06-14 15:02:07,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:07,806 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:02:07,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:07,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:02:07,807 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:02:08,010 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:08,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 222 transitions, 2724 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:08,011 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:08,011 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:08,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:10,024 INFO  L124   PetriNetUnfolderBase]: 3298/4965 cut-off events.
[2024-06-14 15:02:10,025 INFO  L125   PetriNetUnfolderBase]: For 307718/307724 co-relation queries the response was YES.
[2024-06-14 15:02:10,048 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41061 conditions, 4965 events. 3298/4965 cut-off events. For 307718/307724 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25972 event pairs, 763 based on Foata normal form. 20/4984 useless extension candidates. Maximal degree in co-relation 40975. Up to 4337 conditions per place. 
[2024-06-14 15:02:10,067 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 194 selfloop transitions, 73 changer transitions 0/270 dead transitions.
[2024-06-14 15:02:10,067 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 270 transitions, 3701 flow
[2024-06-14 15:02:10,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:02:10,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:02:10,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 15:02:10,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-14 15:02:10,069 INFO  L175             Difference]: Start difference. First operand has 172 places, 222 transitions, 2724 flow. Second operand 9 states and 175 transitions.
[2024-06-14 15:02:10,069 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 270 transitions, 3701 flow
[2024-06-14 15:02:10,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 270 transitions, 3561 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-14 15:02:10,351 INFO  L231             Difference]: Finished difference. Result has 178 places, 230 transitions, 2914 flow
[2024-06-14 15:02:10,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2914, PETRI_PLACES=178, PETRI_TRANSITIONS=230}
[2024-06-14 15:02:10,351 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places.
[2024-06-14 15:02:10,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 230 transitions, 2914 flow
[2024-06-14 15:02:10,352 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:10,352 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:10,352 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:10,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:02:10,352 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-14 15:02:10,353 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:10,353 INFO  L85        PathProgramCache]: Analyzing trace with hash -221137016, now seen corresponding path program 5 times
[2024-06-14 15:02:10,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:10,353 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140172179]
[2024-06-14 15:02:10,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:10,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:10,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:21,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:21,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:21,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140172179]
[2024-06-14 15:02:21,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140172179] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:21,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:21,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:02:21,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231822631]
[2024-06-14 15:02:21,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:21,094 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:02:21,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:21,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:02:21,096 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:02:21,269 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:21,269 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 230 transitions, 2914 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:21,269 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:21,270 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:21,270 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:23,404 INFO  L124   PetriNetUnfolderBase]: 3422/5169 cut-off events.
[2024-06-14 15:02:23,404 INFO  L125   PetriNetUnfolderBase]: For 338395/338401 co-relation queries the response was YES.
[2024-06-14 15:02:23,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43477 conditions, 5169 events. 3422/5169 cut-off events. For 338395/338401 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27312 event pairs, 796 based on Foata normal form. 32/5200 useless extension candidates. Maximal degree in co-relation 43388. Up to 4394 conditions per place. 
[2024-06-14 15:02:23,443 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 195 selfloop transitions, 77 changer transitions 0/275 dead transitions.
[2024-06-14 15:02:23,443 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 275 transitions, 3959 flow
[2024-06-14 15:02:23,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:02:23,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:02:23,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 15:02:23,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-14 15:02:23,445 INFO  L175             Difference]: Start difference. First operand has 178 places, 230 transitions, 2914 flow. Second operand 9 states and 176 transitions.
[2024-06-14 15:02:23,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 275 transitions, 3959 flow
[2024-06-14 15:02:23,716 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 275 transitions, 3765 flow, removed 52 selfloop flow, removed 5 redundant places.
[2024-06-14 15:02:23,720 INFO  L231             Difference]: Finished difference. Result has 182 places, 232 transitions, 2979 flow
[2024-06-14 15:02:23,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2720, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=182, PETRI_TRANSITIONS=232}
[2024-06-14 15:02:23,721 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-14 15:02:23,721 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 232 transitions, 2979 flow
[2024-06-14 15:02:23,721 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:23,721 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:23,721 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:23,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:02:23,722 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-14 15:02:23,722 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:23,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -221140736, now seen corresponding path program 6 times
[2024-06-14 15:02:23,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:23,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987500042]
[2024-06-14 15:02:23,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:23,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:23,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:34,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:34,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:34,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987500042]
[2024-06-14 15:02:34,461 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987500042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:34,461 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:34,461 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:02:34,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858425909]
[2024-06-14 15:02:34,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:34,462 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:02:34,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:34,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:02:34,462 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:02:34,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:34,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 232 transitions, 2979 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:34,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:34,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:34,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:36,860 INFO  L124   PetriNetUnfolderBase]: 3626/5501 cut-off events.
[2024-06-14 15:02:36,860 INFO  L125   PetriNetUnfolderBase]: For 369372/369378 co-relation queries the response was YES.
[2024-06-14 15:02:36,886 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46971 conditions, 5501 events. 3626/5501 cut-off events. For 369372/369378 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29628 event pairs, 867 based on Foata normal form. 26/5526 useless extension candidates. Maximal degree in co-relation 46881. Up to 4252 conditions per place. 
[2024-06-14 15:02:36,908 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 203 selfloop transitions, 79 changer transitions 0/285 dead transitions.
[2024-06-14 15:02:36,908 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 285 transitions, 4363 flow
[2024-06-14 15:02:36,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:02:36,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:02:36,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-14 15:02:36,910 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 15:02:36,910 INFO  L175             Difference]: Start difference. First operand has 182 places, 232 transitions, 2979 flow. Second operand 9 states and 180 transitions.
[2024-06-14 15:02:36,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 285 transitions, 4363 flow
[2024-06-14 15:02:37,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 285 transitions, 4081 flow, removed 39 selfloop flow, removed 10 redundant places.
[2024-06-14 15:02:37,287 INFO  L231             Difference]: Finished difference. Result has 182 places, 236 transitions, 3040 flow
[2024-06-14 15:02:37,287 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3040, PETRI_PLACES=182, PETRI_TRANSITIONS=236}
[2024-06-14 15:02:37,287 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-14 15:02:37,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 236 transitions, 3040 flow
[2024-06-14 15:02:37,288 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:37,288 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:37,288 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:37,288 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:02:37,288 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:37,289 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:37,289 INFO  L85        PathProgramCache]: Analyzing trace with hash 813907252, now seen corresponding path program 1 times
[2024-06-14 15:02:37,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:37,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852197669]
[2024-06-14 15:02:37,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:37,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:37,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:48,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:48,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:48,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852197669]
[2024-06-14 15:02:48,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852197669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:48,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:48,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:02:48,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144863716]
[2024-06-14 15:02:48,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:48,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:02:48,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:48,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:02:48,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:02:48,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:48,875 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 236 transitions, 3040 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:48,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:48,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:48,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:50,833 INFO  L124   PetriNetUnfolderBase]: 3646/5529 cut-off events.
[2024-06-14 15:02:50,833 INFO  L125   PetriNetUnfolderBase]: For 363076/363082 co-relation queries the response was YES.
[2024-06-14 15:02:50,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47028 conditions, 5529 events. 3646/5529 cut-off events. For 363076/363082 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29907 event pairs, 900 based on Foata normal form. 6/5534 useless extension candidates. Maximal degree in co-relation 46939. Up to 5073 conditions per place. 
[2024-06-14 15:02:50,875 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 202 selfloop transitions, 63 changer transitions 0/268 dead transitions.
[2024-06-14 15:02:50,875 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 268 transitions, 3911 flow
[2024-06-14 15:02:50,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:02:50,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:02:50,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 15:02:50,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 15:02:50,876 INFO  L175             Difference]: Start difference. First operand has 182 places, 236 transitions, 3040 flow. Second operand 7 states and 137 transitions.
[2024-06-14 15:02:50,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 268 transitions, 3911 flow
[2024-06-14 15:02:51,169 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 268 transitions, 3722 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-14 15:02:51,173 INFO  L231             Difference]: Finished difference. Result has 184 places, 241 transitions, 3083 flow
[2024-06-14 15:02:51,173 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2856, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3083, PETRI_PLACES=184, PETRI_TRANSITIONS=241}
[2024-06-14 15:02:51,173 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-14 15:02:51,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 241 transitions, 3083 flow
[2024-06-14 15:02:51,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:51,173 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:51,174 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:51,174 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:02:51,174 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-14 15:02:51,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:51,174 INFO  L85        PathProgramCache]: Analyzing trace with hash -942081762, now seen corresponding path program 7 times
[2024-06-14 15:02:51,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:51,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202526945]
[2024-06-14 15:02:51,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:51,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:51,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:01,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:01,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:01,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202526945]
[2024-06-14 15:03:01,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202526945] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:01,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:01,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:01,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676497805]
[2024-06-14 15:03:01,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:01,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:01,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:01,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:01,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:01,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:01,876 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 241 transitions, 3083 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:01,876 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:01,876 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:01,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:04,144 INFO  L124   PetriNetUnfolderBase]: 3836/5843 cut-off events.
[2024-06-14 15:03:04,144 INFO  L125   PetriNetUnfolderBase]: For 415877/415883 co-relation queries the response was YES.
[2024-06-14 15:03:04,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50280 conditions, 5843 events. 3836/5843 cut-off events. For 415877/415883 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32249 event pairs, 757 based on Foata normal form. 26/5868 useless extension candidates. Maximal degree in co-relation 50189. Up to 4334 conditions per place. 
[2024-06-14 15:03:04,197 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 198 selfloop transitions, 103 changer transitions 0/304 dead transitions.
[2024-06-14 15:03:04,197 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 304 transitions, 4716 flow
[2024-06-14 15:03:04,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:03:04,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:03:04,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-14 15:03:04,198 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-14 15:03:04,198 INFO  L175             Difference]: Start difference. First operand has 184 places, 241 transitions, 3083 flow. Second operand 9 states and 189 transitions.
[2024-06-14 15:03:04,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 304 transitions, 4716 flow
[2024-06-14 15:03:04,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 304 transitions, 4603 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 15:03:04,587 INFO  L231             Difference]: Finished difference. Result has 191 places, 248 transitions, 3465 flow
[2024-06-14 15:03:04,587 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3465, PETRI_PLACES=191, PETRI_TRANSITIONS=248}
[2024-06-14 15:03:04,588 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-14 15:03:04,588 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 248 transitions, 3465 flow
[2024-06-14 15:03:04,588 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:04,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:04,588 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:04,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:03:04,589 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-14 15:03:04,589 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:04,589 INFO  L85        PathProgramCache]: Analyzing trace with hash -942078042, now seen corresponding path program 8 times
[2024-06-14 15:03:04,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:04,589 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664819688]
[2024-06-14 15:03:04,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:04,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:04,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:15,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:15,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:15,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664819688]
[2024-06-14 15:03:15,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664819688] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:15,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:15,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:15,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750984857]
[2024-06-14 15:03:15,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:15,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:15,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:15,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:15,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:15,622 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:15,622 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 248 transitions, 3465 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:15,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:15,622 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:15,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:17,997 INFO  L124   PetriNetUnfolderBase]: 3960/6047 cut-off events.
[2024-06-14 15:03:17,997 INFO  L125   PetriNetUnfolderBase]: For 454096/454102 co-relation queries the response was YES.
[2024-06-14 15:03:18,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53598 conditions, 6047 events. 3960/6047 cut-off events. For 454096/454102 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 33717 event pairs, 976 based on Foata normal form. 32/6078 useless extension candidates. Maximal degree in co-relation 53504. Up to 5213 conditions per place. 
[2024-06-14 15:03:18,053 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 214 selfloop transitions, 81 changer transitions 0/298 dead transitions.
[2024-06-14 15:03:18,053 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 298 transitions, 4587 flow
[2024-06-14 15:03:18,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:03:18,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:03:18,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-14 15:03:18,055 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-14 15:03:18,055 INFO  L175             Difference]: Start difference. First operand has 191 places, 248 transitions, 3465 flow. Second operand 9 states and 182 transitions.
[2024-06-14 15:03:18,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 298 transitions, 4587 flow
[2024-06-14 15:03:18,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 298 transitions, 4250 flow, removed 53 selfloop flow, removed 6 redundant places.
[2024-06-14 15:03:18,740 INFO  L231             Difference]: Finished difference. Result has 194 places, 250 transitions, 3408 flow
[2024-06-14 15:03:18,740 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3133, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3408, PETRI_PLACES=194, PETRI_TRANSITIONS=250}
[2024-06-14 15:03:18,741 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-14 15:03:18,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 250 transitions, 3408 flow
[2024-06-14 15:03:18,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:18,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:18,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:18,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:03:18,742 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-14 15:03:18,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:18,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -1319724252, now seen corresponding path program 9 times
[2024-06-14 15:03:18,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:18,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502638648]
[2024-06-14 15:03:18,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:18,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:18,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:29,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:29,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:29,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502638648]
[2024-06-14 15:03:29,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502638648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:29,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:29,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:29,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353051594]
[2024-06-14 15:03:29,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:29,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:29,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:29,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:29,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:29,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:29,885 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 250 transitions, 3408 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:29,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:29,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:29,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:32,324 INFO  L124   PetriNetUnfolderBase]: 4044/6179 cut-off events.
[2024-06-14 15:03:32,324 INFO  L125   PetriNetUnfolderBase]: For 464041/464047 co-relation queries the response was YES.
[2024-06-14 15:03:32,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53467 conditions, 6179 events. 4044/6179 cut-off events. For 464041/464047 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 34619 event pairs, 993 based on Foata normal form. 20/6198 useless extension candidates. Maximal degree in co-relation 53374. Up to 5541 conditions per place. 
[2024-06-14 15:03:32,374 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 207 selfloop transitions, 86 changer transitions 0/296 dead transitions.
[2024-06-14 15:03:32,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 296 transitions, 4427 flow
[2024-06-14 15:03:32,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:03:32,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:03:32,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-14 15:03:32,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-14 15:03:32,375 INFO  L175             Difference]: Start difference. First operand has 194 places, 250 transitions, 3408 flow. Second operand 9 states and 177 transitions.
[2024-06-14 15:03:32,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 296 transitions, 4427 flow
[2024-06-14 15:03:32,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 296 transitions, 4197 flow, removed 36 selfloop flow, removed 7 redundant places.
[2024-06-14 15:03:32,918 INFO  L231             Difference]: Finished difference. Result has 196 places, 254 transitions, 3501 flow
[2024-06-14 15:03:32,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3178, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3501, PETRI_PLACES=196, PETRI_TRANSITIONS=254}
[2024-06-14 15:03:32,919 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places.
[2024-06-14 15:03:32,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 254 transitions, 3501 flow
[2024-06-14 15:03:32,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:32,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:32,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:32,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:03:32,920 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-14 15:03:32,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:32,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -941927940, now seen corresponding path program 1 times
[2024-06-14 15:03:32,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:32,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821487808]
[2024-06-14 15:03:32,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:32,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:32,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:42,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:42,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:42,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821487808]
[2024-06-14 15:03:42,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821487808] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:42,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:42,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:03:42,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768477937]
[2024-06-14 15:03:42,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:42,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:03:42,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:42,661 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:03:42,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:03:42,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:42,851 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 254 transitions, 3501 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:42,851 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:42,851 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:42,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:45,002 INFO  L124   PetriNetUnfolderBase]: 4072/6223 cut-off events.
[2024-06-14 15:03:45,003 INFO  L125   PetriNetUnfolderBase]: For 462811/462817 co-relation queries the response was YES.
[2024-06-14 15:03:45,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54024 conditions, 6223 events. 4072/6223 cut-off events. For 462811/462817 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 34938 event pairs, 996 based on Foata normal form. 8/6230 useless extension candidates. Maximal degree in co-relation 53930. Up to 5741 conditions per place. 
[2024-06-14 15:03:45,060 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 224 selfloop transitions, 65 changer transitions 0/292 dead transitions.
[2024-06-14 15:03:45,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 292 transitions, 4473 flow
[2024-06-14 15:03:45,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:03:45,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:03:45,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-14 15:03:45,061 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 15:03:45,061 INFO  L175             Difference]: Start difference. First operand has 196 places, 254 transitions, 3501 flow. Second operand 8 states and 156 transitions.
[2024-06-14 15:03:45,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 292 transitions, 4473 flow
[2024-06-14 15:03:45,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 292 transitions, 4188 flow, removed 60 selfloop flow, removed 7 redundant places.
[2024-06-14 15:03:45,777 INFO  L231             Difference]: Finished difference. Result has 197 places, 257 transitions, 3470 flow
[2024-06-14 15:03:45,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3470, PETRI_PLACES=197, PETRI_TRANSITIONS=257}
[2024-06-14 15:03:45,778 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-14 15:03:45,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 257 transitions, 3470 flow
[2024-06-14 15:03:45,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:45,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:45,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:45,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:03:45,779 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-14 15:03:45,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:45,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -936363750, now seen corresponding path program 2 times
[2024-06-14 15:03:45,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:45,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805801142]
[2024-06-14 15:03:45,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:45,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:45,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:56,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:56,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:56,019 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805801142]
[2024-06-14 15:03:56,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805801142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:56,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:56,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:03:56,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235302426]
[2024-06-14 15:03:56,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:56,020 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:03:56,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:56,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:03:56,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:03:56,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:56,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 257 transitions, 3470 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:56,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:56,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:56,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:58,505 INFO  L124   PetriNetUnfolderBase]: 4100/6267 cut-off events.
[2024-06-14 15:03:58,505 INFO  L125   PetriNetUnfolderBase]: For 474125/474131 co-relation queries the response was YES.
[2024-06-14 15:03:58,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54066 conditions, 6267 events. 4100/6267 cut-off events. For 474125/474131 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 35275 event pairs, 998 based on Foata normal form. 8/6274 useless extension candidates. Maximal degree in co-relation 53971. Up to 5785 conditions per place. 
[2024-06-14 15:03:58,559 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 227 selfloop transitions, 61 changer transitions 0/291 dead transitions.
[2024-06-14 15:03:58,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 291 transitions, 4342 flow
[2024-06-14 15:03:58,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:03:58,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:03:58,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 15:03:58,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-14 15:03:58,560 INFO  L175             Difference]: Start difference. First operand has 197 places, 257 transitions, 3470 flow. Second operand 8 states and 151 transitions.
[2024-06-14 15:03:58,561 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 291 transitions, 4342 flow
[2024-06-14 15:03:59,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 291 transitions, 4112 flow, removed 52 selfloop flow, removed 6 redundant places.
[2024-06-14 15:03:59,069 INFO  L231             Difference]: Finished difference. Result has 199 places, 260 transitions, 3492 flow
[2024-06-14 15:03:59,069 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3240, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3492, PETRI_PLACES=199, PETRI_TRANSITIONS=260}
[2024-06-14 15:03:59,069 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-14 15:03:59,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 260 transitions, 3492 flow
[2024-06-14 15:03:59,069 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:59,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:59,069 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:59,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:03:59,070 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-14 15:03:59,070 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:59,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -1314361872, now seen corresponding path program 10 times
[2024-06-14 15:03:59,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:59,070 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883883882]
[2024-06-14 15:03:59,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:59,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:59,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:10,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:10,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:10,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883883882]
[2024-06-14 15:04:10,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883883882] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:10,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:10,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:04:10,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381954065]
[2024-06-14 15:04:10,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:10,164 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:04:10,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:10,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:04:10,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:04:10,407 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:10,408 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 260 transitions, 3492 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:10,408 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:10,408 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:10,408 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:12,813 INFO  L124   PetriNetUnfolderBase]: 4184/6399 cut-off events.
[2024-06-14 15:04:12,813 INFO  L125   PetriNetUnfolderBase]: For 515131/515137 co-relation queries the response was YES.
[2024-06-14 15:04:12,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55651 conditions, 6399 events. 4184/6399 cut-off events. For 515131/515137 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 36252 event pairs, 980 based on Foata normal form. 20/6418 useless extension candidates. Maximal degree in co-relation 55555. Up to 5761 conditions per place. 
[2024-06-14 15:04:12,875 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 219 selfloop transitions, 80 changer transitions 0/302 dead transitions.
[2024-06-14 15:04:12,876 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 302 transitions, 4437 flow
[2024-06-14 15:04:12,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:04:12,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:04:12,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 15:04:12,877 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 15:04:12,877 INFO  L175             Difference]: Start difference. First operand has 199 places, 260 transitions, 3492 flow. Second operand 9 states and 172 transitions.
[2024-06-14 15:04:12,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 302 transitions, 4437 flow
[2024-06-14 15:04:13,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 302 transitions, 4209 flow, removed 55 selfloop flow, removed 6 redundant places.
[2024-06-14 15:04:13,369 INFO  L231             Difference]: Finished difference. Result has 202 places, 264 transitions, 3587 flow
[2024-06-14 15:04:13,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3264, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3587, PETRI_PLACES=202, PETRI_TRANSITIONS=264}
[2024-06-14 15:04:13,369 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places.
[2024-06-14 15:04:13,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 264 transitions, 3587 flow
[2024-06-14 15:04:13,370 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:13,370 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:13,370 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:13,370 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:04:13,370 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:13,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:13,371 INFO  L85        PathProgramCache]: Analyzing trace with hash -265201066, now seen corresponding path program 3 times
[2024-06-14 15:04:13,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:13,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868448958]
[2024-06-14 15:04:13,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:13,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:13,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:23,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:23,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:23,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868448958]
[2024-06-14 15:04:23,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868448958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:23,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:23,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:04:23,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648545108]
[2024-06-14 15:04:23,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:23,327 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:04:23,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:23,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:04:23,328 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:04:23,677 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:23,678 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 264 transitions, 3587 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:23,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:23,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:23,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:26,030 INFO  L124   PetriNetUnfolderBase]: 4212/6443 cut-off events.
[2024-06-14 15:04:26,030 INFO  L125   PetriNetUnfolderBase]: For 522712/522718 co-relation queries the response was YES.
[2024-06-14 15:04:26,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56905 conditions, 6443 events. 4212/6443 cut-off events. For 522712/522718 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36610 event pairs, 968 based on Foata normal form. 8/6450 useless extension candidates. Maximal degree in co-relation 56808. Up to 5807 conditions per place. 
[2024-06-14 15:04:26,085 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 72 changer transitions 0/298 dead transitions.
[2024-06-14 15:04:26,085 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 298 transitions, 4483 flow
[2024-06-14 15:04:26,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:04:26,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:04:26,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 15:04:26,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-14 15:04:26,087 INFO  L175             Difference]: Start difference. First operand has 202 places, 264 transitions, 3587 flow. Second operand 8 states and 151 transitions.
[2024-06-14 15:04:26,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 298 transitions, 4483 flow
[2024-06-14 15:04:26,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 298 transitions, 4197 flow, removed 66 selfloop flow, removed 7 redundant places.
[2024-06-14 15:04:26,686 INFO  L231             Difference]: Finished difference. Result has 203 places, 267 transitions, 3584 flow
[2024-06-14 15:04:26,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3584, PETRI_PLACES=203, PETRI_TRANSITIONS=267}
[2024-06-14 15:04:26,687 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-14 15:04:26,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 267 transitions, 3584 flow
[2024-06-14 15:04:26,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:26,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:26,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:26,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:04:26,687 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-14 15:04:26,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:26,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136962836, now seen corresponding path program 2 times
[2024-06-14 15:04:26,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:26,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274968112]
[2024-06-14 15:04:26,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:26,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:26,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:37,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:37,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:37,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274968112]
[2024-06-14 15:04:37,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274968112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:37,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:37,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:04:37,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085780696]
[2024-06-14 15:04:37,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:37,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:04:37,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:37,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:04:37,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:04:37,771 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:37,771 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 267 transitions, 3584 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:37,771 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:37,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:37,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:40,073 INFO  L124   PetriNetUnfolderBase]: 4278/6535 cut-off events.
[2024-06-14 15:04:40,073 INFO  L125   PetriNetUnfolderBase]: For 535460/535466 co-relation queries the response was YES.
[2024-06-14 15:04:40,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57667 conditions, 6535 events. 4278/6535 cut-off events. For 535460/535466 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37087 event pairs, 1014 based on Foata normal form. 6/6540 useless extension candidates. Maximal degree in co-relation 57569. Up to 6033 conditions per place. 
[2024-06-14 15:04:40,126 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 228 selfloop transitions, 70 changer transitions 0/301 dead transitions.
[2024-06-14 15:04:40,126 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 301 transitions, 4693 flow
[2024-06-14 15:04:40,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:04:40,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:04:40,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-14 15:04:40,127 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-14 15:04:40,127 INFO  L175             Difference]: Start difference. First operand has 203 places, 267 transitions, 3584 flow. Second operand 7 states and 131 transitions.
[2024-06-14 15:04:40,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 301 transitions, 4693 flow
[2024-06-14 15:04:40,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 301 transitions, 4416 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-14 15:04:40,680 INFO  L231             Difference]: Finished difference. Result has 205 places, 280 transitions, 3744 flow
[2024-06-14 15:04:40,680 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3327, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3744, PETRI_PLACES=205, PETRI_TRANSITIONS=280}
[2024-06-14 15:04:40,680 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-14 15:04:40,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 280 transitions, 3744 flow
[2024-06-14 15:04:40,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:40,681 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:40,681 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:40,681 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:04:40,681 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-14 15:04:40,681 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:40,681 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136962464, now seen corresponding path program 1 times
[2024-06-14 15:04:40,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:40,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144495417]
[2024-06-14 15:04:40,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:40,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:40,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:51,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:51,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:51,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144495417]
[2024-06-14 15:04:51,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144495417] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:51,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:51,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:04:51,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654030080]
[2024-06-14 15:04:51,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:51,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:04:51,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:51,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:04:51,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:04:51,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:51,590 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 280 transitions, 3744 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:51,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:51,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:51,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:53,756 INFO  L124   PetriNetUnfolderBase]: 4309/6577 cut-off events.
[2024-06-14 15:04:53,756 INFO  L125   PetriNetUnfolderBase]: For 549476/549476 co-relation queries the response was YES.
[2024-06-14 15:04:53,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58113 conditions, 6577 events. 4309/6577 cut-off events. For 549476/549476 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37230 event pairs, 1157 based on Foata normal form. 3/6579 useless extension candidates. Maximal degree in co-relation 58013. Up to 6512 conditions per place. 
[2024-06-14 15:04:53,822 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 284 selfloop transitions, 23 changer transitions 0/310 dead transitions.
[2024-06-14 15:04:53,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 310 transitions, 4620 flow
[2024-06-14 15:04:53,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:04:53,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:04:53,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 15:04:53,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-14 15:04:53,823 INFO  L175             Difference]: Start difference. First operand has 205 places, 280 transitions, 3744 flow. Second operand 7 states and 123 transitions.
[2024-06-14 15:04:53,823 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 310 transitions, 4620 flow
[2024-06-14 15:04:54,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 310 transitions, 4522 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-14 15:04:54,453 INFO  L231             Difference]: Finished difference. Result has 210 places, 289 transitions, 3824 flow
[2024-06-14 15:04:54,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3646, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3824, PETRI_PLACES=210, PETRI_TRANSITIONS=289}
[2024-06-14 15:04:54,454 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-14 15:04:54,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 289 transitions, 3824 flow
[2024-06-14 15:04:54,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:54,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:54,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:54,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:04:54,454 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:54,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:54,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 251059763, now seen corresponding path program 1 times
[2024-06-14 15:04:54,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:54,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430970926]
[2024-06-14 15:04:54,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:54,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:54,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:04,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:04,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:04,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430970926]
[2024-06-14 15:05:04,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430970926] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:04,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:04,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:05:04,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190360713]
[2024-06-14 15:05:04,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:04,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:05:04,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:04,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:05:04,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:05:04,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:04,375 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 289 transitions, 3824 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:04,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:04,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:04,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:06,819 INFO  L124   PetriNetUnfolderBase]: 4309/6578 cut-off events.
[2024-06-14 15:05:06,819 INFO  L125   PetriNetUnfolderBase]: For 564160/564166 co-relation queries the response was YES.
[2024-06-14 15:05:06,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58388 conditions, 6578 events. 4309/6578 cut-off events. For 564160/564166 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37269 event pairs, 1132 based on Foata normal form. 9/6586 useless extension candidates. Maximal degree in co-relation 58286. Up to 6390 conditions per place. 
[2024-06-14 15:05:06,880 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 269 selfloop transitions, 47 changer transitions 0/319 dead transitions.
[2024-06-14 15:05:06,880 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 319 transitions, 4648 flow
[2024-06-14 15:05:06,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:05:06,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:05:06,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-14 15:05:06,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-14 15:05:06,882 INFO  L175             Difference]: Start difference. First operand has 210 places, 289 transitions, 3824 flow. Second operand 8 states and 145 transitions.
[2024-06-14 15:05:06,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 319 transitions, 4648 flow
[2024-06-14 15:05:07,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 319 transitions, 4582 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-14 15:05:07,493 INFO  L231             Difference]: Finished difference. Result has 215 places, 293 transitions, 3996 flow
[2024-06-14 15:05:07,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3758, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3996, PETRI_PLACES=215, PETRI_TRANSITIONS=293}
[2024-06-14 15:05:07,493 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places.
[2024-06-14 15:05:07,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 293 transitions, 3996 flow
[2024-06-14 15:05:07,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:07,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:07,494 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:07,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:05:07,494 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:07,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:07,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803707004, now seen corresponding path program 4 times
[2024-06-14 15:05:07,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:07,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498846295]
[2024-06-14 15:05:07,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:07,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:07,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:17,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:17,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:17,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498846295]
[2024-06-14 15:05:17,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498846295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:17,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:17,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:05:17,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549900838]
[2024-06-14 15:05:17,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:17,614 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:05:17,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:17,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:05:17,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:05:17,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:17,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 293 transitions, 3996 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:17,830 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:17,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:17,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:20,266 INFO  L124   PetriNetUnfolderBase]: 4334/6617 cut-off events.
[2024-06-14 15:05:20,267 INFO  L125   PetriNetUnfolderBase]: For 589499/589505 co-relation queries the response was YES.
[2024-06-14 15:05:20,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59226 conditions, 6617 events. 4334/6617 cut-off events. For 589499/589505 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 37542 event pairs, 1142 based on Foata normal form. 12/6628 useless extension candidates. Maximal degree in co-relation 59122. Up to 6441 conditions per place. 
[2024-06-14 15:05:20,326 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 277 selfloop transitions, 42 changer transitions 0/322 dead transitions.
[2024-06-14 15:05:20,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 322 transitions, 4834 flow
[2024-06-14 15:05:20,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:05:20,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:05:20,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:05:20,327 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 15:05:20,327 INFO  L175             Difference]: Start difference. First operand has 215 places, 293 transitions, 3996 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:05:20,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 322 transitions, 4834 flow
[2024-06-14 15:05:21,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 322 transitions, 4656 flow, removed 47 selfloop flow, removed 6 redundant places.
[2024-06-14 15:05:21,019 INFO  L231             Difference]: Finished difference. Result has 217 places, 296 transitions, 4049 flow
[2024-06-14 15:05:21,020 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3818, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4049, PETRI_PLACES=217, PETRI_TRANSITIONS=296}
[2024-06-14 15:05:21,020 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-14 15:05:21,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 296 transitions, 4049 flow
[2024-06-14 15:05:21,020 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:21,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:21,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:21,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:05:21,021 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:21,021 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:21,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547213934, now seen corresponding path program 5 times
[2024-06-14 15:05:21,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:21,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087653167]
[2024-06-14 15:05:21,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:21,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:21,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:30,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:30,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:30,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087653167]
[2024-06-14 15:05:30,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087653167] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:30,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:30,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:05:30,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976672206]
[2024-06-14 15:05:30,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:30,487 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:05:30,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:30,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:05:30,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:05:30,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:30,772 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 296 transitions, 4049 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:30,772 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:30,772 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:30,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:33,268 INFO  L124   PetriNetUnfolderBase]: 4384/6695 cut-off events.
[2024-06-14 15:05:33,269 INFO  L125   PetriNetUnfolderBase]: For 618784/618790 co-relation queries the response was YES.
[2024-06-14 15:05:33,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60584 conditions, 6695 events. 4384/6695 cut-off events. For 618784/618790 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 38097 event pairs, 1148 based on Foata normal form. 12/6706 useless extension candidates. Maximal degree in co-relation 60479. Up to 6512 conditions per place. 
[2024-06-14 15:05:33,330 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 291 selfloop transitions, 34 changer transitions 0/328 dead transitions.
[2024-06-14 15:05:33,330 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 328 transitions, 5044 flow
[2024-06-14 15:05:33,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:05:33,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:05:33,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 15:05:33,331 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-14 15:05:33,331 INFO  L175             Difference]: Start difference. First operand has 217 places, 296 transitions, 4049 flow. Second operand 8 states and 143 transitions.
[2024-06-14 15:05:33,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 328 transitions, 5044 flow
[2024-06-14 15:05:34,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 328 transitions, 4710 flow, removed 126 selfloop flow, removed 6 redundant places.
[2024-06-14 15:05:34,154 INFO  L231             Difference]: Finished difference. Result has 220 places, 302 transitions, 4090 flow
[2024-06-14 15:05:34,155 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4090, PETRI_PLACES=220, PETRI_TRANSITIONS=302}
[2024-06-14 15:05:34,155 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-14 15:05:34,155 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 302 transitions, 4090 flow
[2024-06-14 15:05:34,155 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:34,155 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:34,155 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:34,155 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:05:34,155 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:34,156 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:34,156 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803714444, now seen corresponding path program 6 times
[2024-06-14 15:05:34,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:34,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861472120]
[2024-06-14 15:05:34,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:34,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:34,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:43,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:43,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:43,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861472120]
[2024-06-14 15:05:43,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861472120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:43,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:43,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:05:43,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473432737]
[2024-06-14 15:05:43,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:43,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:05:43,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:43,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:05:43,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:05:43,813 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:43,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 302 transitions, 4090 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:43,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:43,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:43,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:46,293 INFO  L124   PetriNetUnfolderBase]: 4409/6734 cut-off events.
[2024-06-14 15:05:46,293 INFO  L125   PetriNetUnfolderBase]: For 636761/636767 co-relation queries the response was YES.
[2024-06-14 15:05:46,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61023 conditions, 6734 events. 4409/6734 cut-off events. For 636761/636767 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38412 event pairs, 1149 based on Foata normal form. 12/6745 useless extension candidates. Maximal degree in co-relation 60916. Up to 6431 conditions per place. 
[2024-06-14 15:05:46,364 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 273 selfloop transitions, 55 changer transitions 0/331 dead transitions.
[2024-06-14 15:05:46,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 331 transitions, 4956 flow
[2024-06-14 15:05:46,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:05:46,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:05:46,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-14 15:05:46,365 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-14 15:05:46,365 INFO  L175             Difference]: Start difference. First operand has 220 places, 302 transitions, 4090 flow. Second operand 8 states and 145 transitions.
[2024-06-14 15:05:46,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 331 transitions, 4956 flow
[2024-06-14 15:05:47,141 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 331 transitions, 4768 flow, removed 66 selfloop flow, removed 5 redundant places.
[2024-06-14 15:05:47,145 INFO  L231             Difference]: Finished difference. Result has 223 places, 305 transitions, 4174 flow
[2024-06-14 15:05:47,145 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3902, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4174, PETRI_PLACES=223, PETRI_TRANSITIONS=305}
[2024-06-14 15:05:47,146 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places.
[2024-06-14 15:05:47,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 305 transitions, 4174 flow
[2024-06-14 15:05:47,146 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:47,146 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:47,146 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:47,146 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 15:05:47,146 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-14 15:05:47,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:47,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812911214, now seen corresponding path program 7 times
[2024-06-14 15:05:47,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:47,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952012931]
[2024-06-14 15:05:47,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:47,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:47,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:56,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:56,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:56,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952012931]
[2024-06-14 15:05:56,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952012931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:56,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:56,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:05:56,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544709012]
[2024-06-14 15:05:56,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:56,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:05:56,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:56,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:05:56,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:05:56,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:56,659 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 305 transitions, 4174 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:56,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:56,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:56,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:59,205 INFO  L124   PetriNetUnfolderBase]: 4409/6734 cut-off events.
[2024-06-14 15:05:59,205 INFO  L125   PetriNetUnfolderBase]: For 649447/649453 co-relation queries the response was YES.
[2024-06-14 15:05:59,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61212 conditions, 6734 events. 4409/6734 cut-off events. For 649447/649453 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38288 event pairs, 1140 based on Foata normal form. 12/6745 useless extension candidates. Maximal degree in co-relation 61104. Up to 6582 conditions per place. 
[2024-06-14 15:05:59,265 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 299 selfloop transitions, 32 changer transitions 0/334 dead transitions.
[2024-06-14 15:05:59,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 334 transitions, 5050 flow
[2024-06-14 15:05:59,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:05:59,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:05:59,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 15:05:59,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 15:05:59,266 INFO  L175             Difference]: Start difference. First operand has 223 places, 305 transitions, 4174 flow. Second operand 8 states and 142 transitions.
[2024-06-14 15:05:59,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 334 transitions, 5050 flow
[2024-06-14 15:06:00,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 334 transitions, 4800 flow, removed 74 selfloop flow, removed 6 redundant places.
[2024-06-14 15:06:00,030 INFO  L231             Difference]: Finished difference. Result has 225 places, 308 transitions, 4152 flow
[2024-06-14 15:06:00,030 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4152, PETRI_PLACES=225, PETRI_TRANSITIONS=308}
[2024-06-14 15:06:00,031 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places.
[2024-06-14 15:06:00,031 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 308 transitions, 4152 flow
[2024-06-14 15:06:00,031 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:00,031 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:00,031 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:00,031 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 15:06:00,032 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-14 15:06:00,032 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:00,032 INFO  L85        PathProgramCache]: Analyzing trace with hash 1546998732, now seen corresponding path program 11 times
[2024-06-14 15:06:00,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:00,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813417337]
[2024-06-14 15:06:00,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:00,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:00,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:06:10,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:06:10,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:06:10,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813417337]
[2024-06-14 15:06:10,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813417337] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:06:10,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:06:10,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:06:10,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706401327]
[2024-06-14 15:06:10,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:06:10,286 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:06:10,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:06:10,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:06:10,287 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:06:10,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:06:10,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 308 transitions, 4152 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:10,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:06:10,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:06:10,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:12,989 INFO  L124   PetriNetUnfolderBase]: 4445/6798 cut-off events.
[2024-06-14 15:06:12,989 INFO  L125   PetriNetUnfolderBase]: For 696063/696069 co-relation queries the response was YES.
[2024-06-14 15:06:13,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59726 conditions, 6798 events. 4445/6798 cut-off events. For 696063/696069 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38847 event pairs, 1120 based on Foata normal form. 60/6857 useless extension candidates. Maximal degree in co-relation 59617. Up to 6324 conditions per place. 
[2024-06-14 15:06:13,060 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 293 selfloop transitions, 50 changer transitions 0/346 dead transitions.
[2024-06-14 15:06:13,061 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 346 transitions, 5117 flow
[2024-06-14 15:06:13,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:06:13,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:06:13,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-14 15:06:13,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-14 15:06:13,062 INFO  L175             Difference]: Start difference. First operand has 225 places, 308 transitions, 4152 flow. Second operand 9 states and 164 transitions.
[2024-06-14 15:06:13,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 346 transitions, 5117 flow
[2024-06-14 15:06:13,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 346 transitions, 4919 flow, removed 69 selfloop flow, removed 6 redundant places.
[2024-06-14 15:06:13,931 INFO  L231             Difference]: Finished difference. Result has 228 places, 311 transitions, 4226 flow
[2024-06-14 15:06:13,931 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3954, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4226, PETRI_PLACES=228, PETRI_TRANSITIONS=311}
[2024-06-14 15:06:13,932 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-14 15:06:13,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 311 transitions, 4226 flow
[2024-06-14 15:06:13,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:13,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:13,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:13,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 15:06:13,933 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:06:13,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:13,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -1764824824, now seen corresponding path program 2 times
[2024-06-14 15:06:13,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:13,933 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656570963]
[2024-06-14 15:06:13,933 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:13,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:13,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:06:24,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-14 15:06:24,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:06:24,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656570963]
[2024-06-14 15:06:24,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656570963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:06:24,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:06:24,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:06:24,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632732134]
[2024-06-14 15:06:24,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:06:24,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:06:24,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:06:24,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:06:24,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:06:24,868 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:06:24,868 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 311 transitions, 4226 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:24,868 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:06:24,868 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:06:24,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:27,264 INFO  L124   PetriNetUnfolderBase]: 4460/6818 cut-off events.
[2024-06-14 15:06:27,264 INFO  L125   PetriNetUnfolderBase]: For 627507/627507 co-relation queries the response was YES.
[2024-06-14 15:06:27,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60157 conditions, 6818 events. 4460/6818 cut-off events. For 627507/627507 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38932 event pairs, 1151 based on Foata normal form. 3/6820 useless extension candidates. Maximal degree in co-relation 60047. Up to 6773 conditions per place. 
[2024-06-14 15:06:27,326 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 307 selfloop transitions, 19 changer transitions 0/329 dead transitions.
[2024-06-14 15:06:27,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 329 transitions, 5078 flow
[2024-06-14 15:06:27,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:06:27,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:06:27,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-14 15:06:27,327 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.391156462585034
[2024-06-14 15:06:27,327 INFO  L175             Difference]: Start difference. First operand has 228 places, 311 transitions, 4226 flow. Second operand 7 states and 115 transitions.
[2024-06-14 15:06:27,328 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 329 transitions, 5078 flow
[2024-06-14 15:06:28,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 329 transitions, 4885 flow, removed 50 selfloop flow, removed 7 redundant places.
[2024-06-14 15:06:28,196 INFO  L231             Difference]: Finished difference. Result has 228 places, 314 transitions, 4121 flow
[2024-06-14 15:06:28,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4033, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4121, PETRI_PLACES=228, PETRI_TRANSITIONS=314}
[2024-06-14 15:06:28,197 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-14 15:06:28,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 314 transitions, 4121 flow
[2024-06-14 15:06:28,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:28,197 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:28,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:28,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 15:06:28,197 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:06:28,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:28,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 1144860600, now seen corresponding path program 3 times
[2024-06-14 15:06:28,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:28,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758102858]
[2024-06-14 15:06:28,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:28,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:28,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:06:38,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:06:38,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:06:38,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758102858]
[2024-06-14 15:06:38,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758102858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:06:38,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:06:38,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:06:38,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187281002]
[2024-06-14 15:06:38,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:06:38,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:06:38,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:06:38,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:06:38,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:06:38,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:06:38,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 314 transitions, 4121 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:38,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:06:38,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:06:38,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:41,008 INFO  L124   PetriNetUnfolderBase]: 4454/6812 cut-off events.
[2024-06-14 15:06:41,009 INFO  L125   PetriNetUnfolderBase]: For 614638/614644 co-relation queries the response was YES.
[2024-06-14 15:06:41,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58429 conditions, 6812 events. 4454/6812 cut-off events. For 614638/614644 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38951 event pairs, 1153 based on Foata normal form. 6/6817 useless extension candidates. Maximal degree in co-relation 58318. Up to 6716 conditions per place. 
[2024-06-14 15:06:41,072 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 290 selfloop transitions, 34 changer transitions 0/327 dead transitions.
[2024-06-14 15:06:41,072 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 327 transitions, 4923 flow
[2024-06-14 15:06:41,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:06:41,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:06:41,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 15:06:41,073 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-14 15:06:41,073 INFO  L175             Difference]: Start difference. First operand has 228 places, 314 transitions, 4121 flow. Second operand 7 states and 121 transitions.
[2024-06-14 15:06:41,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 327 transitions, 4923 flow
[2024-06-14 15:06:41,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 327 transitions, 4837 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-14 15:06:41,865 INFO  L231             Difference]: Finished difference. Result has 230 places, 314 transitions, 4113 flow
[2024-06-14 15:06:41,866 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4035, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4113, PETRI_PLACES=230, PETRI_TRANSITIONS=314}
[2024-06-14 15:06:41,866 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places.
[2024-06-14 15:06:41,866 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 314 transitions, 4113 flow
[2024-06-14 15:06:41,866 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:41,866 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:41,866 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:41,867 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 15:06:41,867 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:06:41,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:41,867 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145276682, now seen corresponding path program 3 times
[2024-06-14 15:06:41,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:41,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651614881]
[2024-06-14 15:06:41,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:41,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:41,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:06:52,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:06:52,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:06:52,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651614881]
[2024-06-14 15:06:52,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651614881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:06:52,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:06:52,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:06:52,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698779200]
[2024-06-14 15:06:52,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:06:52,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:06:52,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:06:52,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:06:52,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:06:52,828 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:06:52,828 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 314 transitions, 4113 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:52,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:06:52,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:06:52,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:55,180 INFO  L124   PetriNetUnfolderBase]: 4445/6799 cut-off events.
[2024-06-14 15:06:55,180 INFO  L125   PetriNetUnfolderBase]: For 624096/624096 co-relation queries the response was YES.
[2024-06-14 15:06:55,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58442 conditions, 6799 events. 4445/6799 cut-off events. For 624096/624096 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38871 event pairs, 1145 based on Foata normal form. 3/6801 useless extension candidates. Maximal degree in co-relation 58331. Up to 6771 conditions per place. 
[2024-06-14 15:06:55,242 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 309 selfloop transitions, 14 changer transitions 0/326 dead transitions.
[2024-06-14 15:06:55,242 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 326 transitions, 4789 flow
[2024-06-14 15:06:55,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:06:55,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:06:55,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-14 15:06:55,243 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3741496598639456
[2024-06-14 15:06:55,243 INFO  L175             Difference]: Start difference. First operand has 230 places, 314 transitions, 4113 flow. Second operand 7 states and 110 transitions.
[2024-06-14 15:06:55,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 326 transitions, 4789 flow
[2024-06-14 15:06:56,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 326 transitions, 4485 flow, removed 33 selfloop flow, removed 9 redundant places.
[2024-06-14 15:06:56,102 INFO  L231             Difference]: Finished difference. Result has 228 places, 314 transitions, 3843 flow
[2024-06-14 15:06:56,102 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3809, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3843, PETRI_PLACES=228, PETRI_TRANSITIONS=314}
[2024-06-14 15:06:56,103 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-14 15:06:56,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 314 transitions, 3843 flow
[2024-06-14 15:06:56,103 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:06:56,103 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:56,103 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:56,103 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 15:06:56,104 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:06:56,104 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:56,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 1832734954, now seen corresponding path program 1 times
[2024-06-14 15:06:56,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:56,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380710127]
[2024-06-14 15:06:56,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:56,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:56,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:07:10,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:07:10,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:07:10,697 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380710127]
[2024-06-14 15:07:10,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380710127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:07:10,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:07:10,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:07:10,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329776149]
[2024-06-14 15:07:10,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:07:10,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:07:10,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:07:10,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:07:10,698 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:07:10,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:07:10,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 314 transitions, 3843 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:07:10,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:07:10,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:07:10,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:07:13,347 INFO  L124   PetriNetUnfolderBase]: 4490/6862 cut-off events.
[2024-06-14 15:07:13,347 INFO  L125   PetriNetUnfolderBase]: For 649918/649918 co-relation queries the response was YES.
[2024-06-14 15:07:13,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58433 conditions, 6862 events. 4490/6862 cut-off events. For 649918/649918 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39250 event pairs, 1141 based on Foata normal form. 9/6870 useless extension candidates. Maximal degree in co-relation 58323. Up to 6683 conditions per place. 
[2024-06-14 15:07:13,413 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 308 selfloop transitions, 32 changer transitions 0/343 dead transitions.
[2024-06-14 15:07:13,413 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 343 transitions, 4839 flow
[2024-06-14 15:07:13,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:07:13,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:07:13,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 15:07:13,414 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-14 15:07:13,415 INFO  L175             Difference]: Start difference. First operand has 228 places, 314 transitions, 3843 flow. Second operand 7 states and 128 transitions.
[2024-06-14 15:07:13,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 343 transitions, 4839 flow
[2024-06-14 15:07:14,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 343 transitions, 4793 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 15:07:14,270 INFO  L231             Difference]: Finished difference. Result has 229 places, 321 transitions, 3983 flow
[2024-06-14 15:07:14,271 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3799, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3983, PETRI_PLACES=229, PETRI_TRANSITIONS=321}
[2024-06-14 15:07:14,271 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-14 15:07:14,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 321 transitions, 3983 flow
[2024-06-14 15:07:14,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:07:14,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:07:14,271 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:07:14,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 15:07:14,271 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:07:14,272 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:07:14,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -1726209922, now seen corresponding path program 2 times
[2024-06-14 15:07:14,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:07:14,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517368165]
[2024-06-14 15:07:14,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:07:14,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:07:14,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:07:29,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:07:29,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:07:29,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517368165]
[2024-06-14 15:07:29,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517368165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:07:29,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:07:29,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:07:29,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776957144]
[2024-06-14 15:07:29,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:07:29,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:07:29,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:07:29,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:07:29,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:07:29,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:07:29,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 321 transitions, 3983 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:07:29,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:07:29,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:07:29,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:07:31,757 INFO  L124   PetriNetUnfolderBase]: 4505/6884 cut-off events.
[2024-06-14 15:07:31,757 INFO  L125   PetriNetUnfolderBase]: For 641749/641755 co-relation queries the response was YES.
[2024-06-14 15:07:31,794 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59195 conditions, 6884 events. 4505/6884 cut-off events. For 641749/641755 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39328 event pairs, 1157 based on Foata normal form. 5/6888 useless extension candidates. Maximal degree in co-relation 59084. Up to 6691 conditions per place. 
[2024-06-14 15:07:31,824 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 308 selfloop transitions, 38 changer transitions 0/349 dead transitions.
[2024-06-14 15:07:31,824 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 349 transitions, 5091 flow
[2024-06-14 15:07:31,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:07:31,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:07:31,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 15:07:31,825 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-14 15:07:31,825 INFO  L175             Difference]: Start difference. First operand has 229 places, 321 transitions, 3983 flow. Second operand 7 states and 128 transitions.
[2024-06-14 15:07:31,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 349 transitions, 5091 flow
[2024-06-14 15:07:32,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 349 transitions, 5000 flow, removed 35 selfloop flow, removed 3 redundant places.
[2024-06-14 15:07:32,397 INFO  L231             Difference]: Finished difference. Result has 233 places, 327 transitions, 4084 flow
[2024-06-14 15:07:32,397 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4084, PETRI_PLACES=233, PETRI_TRANSITIONS=327}
[2024-06-14 15:07:32,397 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-14 15:07:32,398 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 327 transitions, 4084 flow
[2024-06-14 15:07:32,398 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:07:32,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:07:32,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:07:32,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 15:07:32,398 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:07:32,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:07:32,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145282634, now seen corresponding path program 3 times
[2024-06-14 15:07:32,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:07:32,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706991412]
[2024-06-14 15:07:32,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:07:32,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:07:32,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15