./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_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/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_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-76401ed-m
[2024-06-20 19:58:01,522 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:58:01,585 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:58:01,589 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:58:01,590 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:58:01,611 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:58:01,612 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:58:01,612 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:58:01,613 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:58:01,616 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:58:01,616 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:58:01,616 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:58:01,617 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:58:01,618 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:58:01,618 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:58:01,619 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:58:01,619 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:58:01,619 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:58:01,619 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:58:01,619 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:58:01,620 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:58:01,620 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:58:01,620 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:58:01,620 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:58:01,621 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:58:01,621 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:58:01,621 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:58:01,621 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:58:01,622 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:58:01,622 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:58:01,623 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:58:01,623 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:58:01,623 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:58:01,623 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:58:01,623 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:58:01,623 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:58:01,624 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:58:01,624 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:58:01,624 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:58:01,624 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:58:01,624 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:58:01,625 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:58:01,625 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:58:01,625 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:58:01,851 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:58:01,872 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:58:01,874 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:58:01,875 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:58:01,875 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:58:01,876 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/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-20 19:58:02,061 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:58:02,062 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:58:02,063 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 19:58:03,146 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:58:03,352 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:58:03,352 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 19:58:03,368 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da50b0df/eedf21e99f394d98a7ae13f82fee9871/FLAG54c6a0b64
[2024-06-20 19:58:03,379 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da50b0df/eedf21e99f394d98a7ae13f82fee9871
[2024-06-20 19:58:03,381 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:58:03,382 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:58:03,383 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:58:03,383 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:58:03,388 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:58:03,389 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:58:02" (1/2) ...
[2024-06-20 19:58:03,389 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a5609 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:58:03, skipping insertion in model container
[2024-06-20 19:58:03,390 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:58:02" (1/2) ...
[2024-06-20 19:58:03,392 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c6b8868 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:58:03, skipping insertion in model container
[2024-06-20 19:58:03,392 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:58:03" (2/2) ...
[2024-06-20 19:58:03,393 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a5609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:03, skipping insertion in model container
[2024-06-20 19:58:03,393 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:58:03" (2/2) ...
[2024-06-20 19:58:03,394 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:58:03,461 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:58:03,462 INFO  L97    edCorrectnessWitness]: Location invariant before [L822-L822] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_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$r_buff0_thd0 == (_Bool)0)) && (! 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_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_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) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )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) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (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) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (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 )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_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && 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) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))
[2024-06-20 19:58:03,463 INFO  L97    edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_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$r_buff0_thd0 == (_Bool)0)) && (! 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_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_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) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )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) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (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) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (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 )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_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && 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) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))
[2024-06-20 19:58:03,463 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_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$r_buff0_thd0 == (_Bool)0)) && (! 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_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_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) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )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) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (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) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (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 )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_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && 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) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))
[2024-06-20 19:58:03,464 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:58:03,464 INFO  L106   edCorrectnessWitness]: ghost_update [L817-L817] multithreaded = 1;
[2024-06-20 19:58:03,499 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:58:03,727 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:58:03,734 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:58:03,981 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:58:04,019 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:58:04,019 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04 WrapperNode
[2024-06-20 19:58:04,020 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:58:04,020 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:58:04,021 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:58:04,021 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:58:04,025 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,055 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,132 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142
[2024-06-20 19:58:04,132 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:58:04,133 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:58:04,133 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:58:04,133 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:58:04,142 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,142 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,158 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,199 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 19:58:04,199 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,200 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,219 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,221 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,230 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,237 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,250 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:58:04,250 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:58:04,251 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:58:04,251 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:58:04,251 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (1/1) ...
[2024-06-20 19:58:04,308 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:58:04,315 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:58:04,358 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 19:58:04,391 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 19:58:04,404 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:58:04,404 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:58:04,404 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:58:04,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:58:04,405 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:58:04,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:58:04,405 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:58:04,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:58:04,405 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:58:04,405 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:58:04,405 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:58:04,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:58:04,407 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:58:04,520 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:58:04,521 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:58:05,367 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:58:05,368 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:58:05,586 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:58:05,586 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:58:05,587 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:58:05 BoogieIcfgContainer
[2024-06-20 19:58:05,587 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:58:05,589 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:58:05,590 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:58:05,592 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:58:05,592 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:58:02" (1/4) ...
[2024-06-20 19:58:05,593 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392903c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:58:05, skipping insertion in model container
[2024-06-20 19:58:05,593 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:58:03" (2/4) ...
[2024-06-20 19:58:05,593 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392903c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:58:05, skipping insertion in model container
[2024-06-20 19:58:05,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:58:04" (3/4) ...
[2024-06-20 19:58:05,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392903c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:58:05, skipping insertion in model container
[2024-06-20 19:58:05,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:58:05" (4/4) ...
[2024-06-20 19:58:05,595 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 19:58:05,608 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:58:05,608 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:58:05,609 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:58:05,680 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:58:05,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:58:05,755 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-20 19:58:05,756 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:58:05,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:58:05,757 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:58:05,761 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-20 19:58:05,772 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:58:05,778 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;@90d204a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:58:05,778 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:58:05,785 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:58:05,786 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:58:05,786 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:58:05,786 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:05,786 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:58:05,787 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:05,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:05,793 INFO  L85        PathProgramCache]: Analyzing trace with hash 367698528, now seen corresponding path program 1 times
[2024-06-20 19:58:05,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:05,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866718942]
[2024-06-20 19:58:05,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:05,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:06,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:09,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:09,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:09,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866718942]
[2024-06-20 19:58:09,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866718942] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:09,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:09,841 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:58:09,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182379981]
[2024-06-20 19:58:09,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:09,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:58:09,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:09,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:58:09,872 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:58:09,940 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:58:09,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:09,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:09,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:58:09,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:10,671 INFO  L124   PetriNetUnfolderBase]: 1659/2477 cut-off events.
[2024-06-20 19:58:10,672 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-06-20 19:58:10,678 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5041 conditions, 2477 events. 1659/2477 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11214 event pairs, 1184 based on Foata normal form. 1/2437 useless extension candidates. Maximal degree in co-relation 5029. Up to 2465 conditions per place. 
[2024-06-20 19:58:10,688 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 33 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2024-06-20 19:58:10,689 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 171 flow
[2024-06-20 19:58:10,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:58:10,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:58:10,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions.
[2024-06-20 19:58:10,699 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5583333333333333
[2024-06-20 19:58:10,700 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 67 transitions.
[2024-06-20 19:58:10,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 171 flow
[2024-06-20 19:58:10,704 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:58:10,706 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-20 19:58:10,707 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-20 19:58:10,710 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-20 19:58:10,711 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-20 19:58:10,711 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:10,711 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:10,711 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:10,711 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:58:10,712 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:10,712 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:10,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 1170999743, now seen corresponding path program 1 times
[2024-06-20 19:58:10,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:10,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631673969]
[2024-06-20 19:58:10,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:10,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:10,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:13,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:13,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:13,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631673969]
[2024-06-20 19:58:13,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631673969] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:13,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:13,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:58:13,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411135307]
[2024-06-20 19:58:13,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:13,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:58:13,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:13,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:58:13,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:58:13,668 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:58:13,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:13,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:13,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:58:13,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:14,277 INFO  L124   PetriNetUnfolderBase]: 1653/2468 cut-off events.
[2024-06-20 19:58:14,277 INFO  L125   PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES.
[2024-06-20 19:58:14,280 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5657 conditions, 2468 events. 1653/2468 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11186 event pairs, 1038 based on Foata normal form. 3/2470 useless extension candidates. Maximal degree in co-relation 5645. Up to 2441 conditions per place. 
[2024-06-20 19:58:14,287 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 40 selfloop transitions, 7 changer transitions 0/51 dead transitions.
[2024-06-20 19:58:14,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 238 flow
[2024-06-20 19:58:14,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:58:14,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:58:14,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions.
[2024-06-20 19:58:14,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5375
[2024-06-20 19:58:14,289 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 86 transitions.
[2024-06-20 19:58:14,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 238 flow
[2024-06-20 19:58:14,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:58:14,291 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow
[2024-06-20 19:58:14,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-20 19:58:14,292 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places.
[2024-06-20 19:58:14,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow
[2024-06-20 19:58:14,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:14,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:14,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:14,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:58:14,293 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:14,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:14,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 1941254745, now seen corresponding path program 1 times
[2024-06-20 19:58:14,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:14,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147413150]
[2024-06-20 19:58:14,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:14,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:14,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:16,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:16,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:16,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147413150]
[2024-06-20 19:58:16,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147413150] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:16,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:16,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:58:16,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442200097]
[2024-06-20 19:58:16,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:16,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:58:16,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:16,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:58:16,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:58:16,999 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:58:16,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:16,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:17,000 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:58:17,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:17,628 INFO  L124   PetriNetUnfolderBase]: 1661/2481 cut-off events.
[2024-06-20 19:58:17,628 INFO  L125   PetriNetUnfolderBase]: For 1306/1306 co-relation queries the response was YES.
[2024-06-20 19:58:17,631 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6307 conditions, 2481 events. 1661/2481 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11214 event pairs, 812 based on Foata normal form. 5/2485 useless extension candidates. Maximal degree in co-relation 6293. Up to 2387 conditions per place. 
[2024-06-20 19:58:17,638 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 53 selfloop transitions, 16 changer transitions 0/73 dead transitions.
[2024-06-20 19:58:17,638 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 392 flow
[2024-06-20 19:58:17,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:58:17,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:58:17,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions.
[2024-06-20 19:58:17,640 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.565
[2024-06-20 19:58:17,640 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 113 transitions.
[2024-06-20 19:58:17,640 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 392 flow
[2024-06-20 19:58:17,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 378 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 19:58:17,642 INFO  L231             Difference]: Finished difference. Result has 49 places, 48 transitions, 233 flow
[2024-06-20 19:58:17,642 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=48}
[2024-06-20 19:58:17,643 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places.
[2024-06-20 19:58:17,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 233 flow
[2024-06-20 19:58:17,643 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:17,643 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:17,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:17,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:58:17,644 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:17,644 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:17,645 INFO  L85        PathProgramCache]: Analyzing trace with hash 187884212, now seen corresponding path program 1 times
[2024-06-20 19:58:17,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:17,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027921577]
[2024-06-20 19:58:17,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:17,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:17,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:20,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:20,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:20,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027921577]
[2024-06-20 19:58:20,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027921577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:20,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:20,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:58:20,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020524904]
[2024-06-20 19:58:20,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:20,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:58:20,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:20,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:58:20,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:58:20,427 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:58:20,428 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 233 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-20 19:58:20,428 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:20,428 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:58:20,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:21,248 INFO  L124   PetriNetUnfolderBase]: 1669/2493 cut-off events.
[2024-06-20 19:58:21,249 INFO  L125   PetriNetUnfolderBase]: For 3034/3036 co-relation queries the response was YES.
[2024-06-20 19:58:21,254 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 2493 events. 1669/2493 cut-off events. For 3034/3036 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11279 event pairs, 666 based on Foata normal form. 7/2499 useless extension candidates. Maximal degree in co-relation 7409. Up to 2373 conditions per place. 
[2024-06-20 19:58:21,262 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 60 selfloop transitions, 20 changer transitions 0/84 dead transitions.
[2024-06-20 19:58:21,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 519 flow
[2024-06-20 19:58:21,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:58:21,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:58:21,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-20 19:58:21,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5541666666666667
[2024-06-20 19:58:21,264 INFO  L175             Difference]: Start difference. First operand has 49 places, 48 transitions, 233 flow. Second operand 6 states and 133 transitions.
[2024-06-20 19:58:21,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 519 flow
[2024-06-20 19:58:21,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 511 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-20 19:58:21,268 INFO  L231             Difference]: Finished difference. Result has 55 places, 52 transitions, 306 flow
[2024-06-20 19:58:21,269 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=52}
[2024-06-20 19:58:21,269 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2024-06-20 19:58:21,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 306 flow
[2024-06-20 19:58:21,270 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-20 19:58:21,270 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:21,270 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:21,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:58:21,270 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:21,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:21,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 1530039064, now seen corresponding path program 1 times
[2024-06-20 19:58:21,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:21,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700563977]
[2024-06-20 19:58:21,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:21,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:21,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:23,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:23,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:23,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700563977]
[2024-06-20 19:58:23,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700563977] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:23,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:23,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:58:23,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137854385]
[2024-06-20 19:58:23,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:23,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:58:23,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:23,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:58:23,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:58:24,056 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:58:24,057 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 306 flow. Second operand  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:24,057 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:24,057 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:58:24,057 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:24,878 INFO  L124   PetriNetUnfolderBase]: 1681/2513 cut-off events.
[2024-06-20 19:58:24,878 INFO  L125   PetriNetUnfolderBase]: For 4782/4784 co-relation queries the response was YES.
[2024-06-20 19:58:24,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8297 conditions, 2513 events. 1681/2513 cut-off events. For 4782/4784 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11388 event pairs, 502 based on Foata normal form. 12/2524 useless extension candidates. Maximal degree in co-relation 8277. Up to 2341 conditions per place. 
[2024-06-20 19:58:24,891 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 64 selfloop transitions, 23 changer transitions 0/91 dead transitions.
[2024-06-20 19:58:24,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 620 flow
[2024-06-20 19:58:24,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:58:24,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:58:24,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions.
[2024-06-20 19:58:24,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5321428571428571
[2024-06-20 19:58:24,905 INFO  L175             Difference]: Start difference. First operand has 55 places, 52 transitions, 306 flow. Second operand 7 states and 149 transitions.
[2024-06-20 19:58:24,905 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 620 flow
[2024-06-20 19:58:24,908 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 571 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 19:58:24,909 INFO  L231             Difference]: Finished difference. Result has 57 places, 54 transitions, 333 flow
[2024-06-20 19:58:24,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=57, PETRI_TRANSITIONS=54}
[2024-06-20 19:58:24,910 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places.
[2024-06-20 19:58:24,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 333 flow
[2024-06-20 19:58:24,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:24,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:24,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:24,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:58:24,911 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:24,911 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:24,911 INFO  L85        PathProgramCache]: Analyzing trace with hash 945572823, now seen corresponding path program 1 times
[2024-06-20 19:58:24,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:24,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399815761]
[2024-06-20 19:58:24,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:24,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:24,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:30,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:30,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:30,383 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399815761]
[2024-06-20 19:58:30,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399815761] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:30,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:30,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:58:30,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407269362]
[2024-06-20 19:58:30,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:30,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:58:30,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:30,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:58:30,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:58:30,440 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:30,440 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 333 flow. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:30,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:30,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:30,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:31,180 INFO  L124   PetriNetUnfolderBase]: 1676/2505 cut-off events.
[2024-06-20 19:58:31,181 INFO  L125   PetriNetUnfolderBase]: For 6458/6458 co-relation queries the response was YES.
[2024-06-20 19:58:31,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 2505 events. 1676/2505 cut-off events. For 6458/6458 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11316 event pairs, 659 based on Foata normal form. 2/2506 useless extension candidates. Maximal degree in co-relation 8801. Up to 2484 conditions per place. 
[2024-06-20 19:58:31,193 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 54 selfloop transitions, 8 changer transitions 0/65 dead transitions.
[2024-06-20 19:58:31,193 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 485 flow
[2024-06-20 19:58:31,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:58:31,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:58:31,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2024-06-20 19:58:31,194 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.405
[2024-06-20 19:58:31,194 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 333 flow. Second operand 5 states and 81 transitions.
[2024-06-20 19:58:31,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 485 flow
[2024-06-20 19:58:31,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 421 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 19:58:31,198 INFO  L231             Difference]: Finished difference. Result has 57 places, 54 transitions, 293 flow
[2024-06-20 19:58:31,198 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=54}
[2024-06-20 19:58:31,198 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places.
[2024-06-20 19:58:31,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 293 flow
[2024-06-20 19:58:31,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:31,199 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:31,199 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:31,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:58:31,199 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:31,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:31,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -752531503, now seen corresponding path program 1 times
[2024-06-20 19:58:31,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:31,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052070475]
[2024-06-20 19:58:31,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:31,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:31,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:37,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:37,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:37,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052070475]
[2024-06-20 19:58:37,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052070475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:37,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:37,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:58:37,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464648017]
[2024-06-20 19:58:37,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:37,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:58:37,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:37,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:58:37,637 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:58:37,725 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:37,725 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 293 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:37,725 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:37,725 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:37,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:38,536 INFO  L124   PetriNetUnfolderBase]: 1680/2511 cut-off events.
[2024-06-20 19:58:38,537 INFO  L125   PetriNetUnfolderBase]: For 7529/7529 co-relation queries the response was YES.
[2024-06-20 19:58:38,542 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 2511 events. 1680/2511 cut-off events. For 7529/7529 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11310 event pairs, 616 based on Foata normal form. 6/2516 useless extension candidates. Maximal degree in co-relation 8801. Up to 2442 conditions per place. 
[2024-06-20 19:58:38,550 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 64 selfloop transitions, 19 changer transitions 0/86 dead transitions.
[2024-06-20 19:58:38,550 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 593 flow
[2024-06-20 19:58:38,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:58:38,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:58:38,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-20 19:58:38,551 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.384375
[2024-06-20 19:58:38,551 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 293 flow. Second operand 8 states and 123 transitions.
[2024-06-20 19:58:38,551 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 593 flow
[2024-06-20 19:58:38,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 571 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 19:58:38,555 INFO  L231             Difference]: Finished difference. Result has 63 places, 65 transitions, 402 flow
[2024-06-20 19:58:38,555 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=402, PETRI_PLACES=63, PETRI_TRANSITIONS=65}
[2024-06-20 19:58:38,556 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places.
[2024-06-20 19:58:38,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 402 flow
[2024-06-20 19:58:38,556 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:38,556 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:38,557 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:38,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:58:38,557 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:38,557 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:38,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 1964610644, now seen corresponding path program 1 times
[2024-06-20 19:58:38,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:38,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053260561]
[2024-06-20 19:58:38,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:38,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:38,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:43,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:43,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:43,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053260561]
[2024-06-20 19:58:43,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053260561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:43,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:43,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:58:43,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233012132]
[2024-06-20 19:58:43,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:43,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:58:43,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:43,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:58:43,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:58:43,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:43,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 402 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:43,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:43,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:43,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:44,271 INFO  L124   PetriNetUnfolderBase]: 1686/2521 cut-off events.
[2024-06-20 19:58:44,271 INFO  L125   PetriNetUnfolderBase]: For 10547/10551 co-relation queries the response was YES.
[2024-06-20 19:58:44,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 2521 events. 1686/2521 cut-off events. For 10547/10551 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11325 event pairs, 636 based on Foata normal form. 8/2528 useless extension candidates. Maximal degree in co-relation 9775. Up to 2424 conditions per place. 
[2024-06-20 19:58:44,284 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 66 selfloop transitions, 19 changer transitions 0/88 dead transitions.
[2024-06-20 19:58:44,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 672 flow
[2024-06-20 19:58:44,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:58:44,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:58:44,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions.
[2024-06-20 19:58:44,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:58:44,286 INFO  L175             Difference]: Start difference. First operand has 63 places, 65 transitions, 402 flow. Second operand 6 states and 104 transitions.
[2024-06-20 19:58:44,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 672 flow
[2024-06-20 19:58:44,293 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 634 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 19:58:44,294 INFO  L231             Difference]: Finished difference. Result has 65 places, 68 transitions, 436 flow
[2024-06-20 19:58:44,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=65, PETRI_TRANSITIONS=68}
[2024-06-20 19:58:44,295 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places.
[2024-06-20 19:58:44,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 436 flow
[2024-06-20 19:58:44,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:44,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:44,295 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:44,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:58:44,295 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:44,296 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:44,296 INFO  L85        PathProgramCache]: Analyzing trace with hash -1837559882, now seen corresponding path program 2 times
[2024-06-20 19:58:44,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:44,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927976810]
[2024-06-20 19:58:44,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:44,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:44,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:48,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:48,813 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:48,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927976810]
[2024-06-20 19:58:48,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927976810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:48,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:48,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:58:48,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695158706]
[2024-06-20 19:58:48,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:48,814 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:58:48,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:48,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:58:48,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:58:48,911 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:48,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 436 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:48,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:48,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:48,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:49,563 INFO  L124   PetriNetUnfolderBase]: 1671/2495 cut-off events.
[2024-06-20 19:58:49,564 INFO  L125   PetriNetUnfolderBase]: For 11723/11723 co-relation queries the response was YES.
[2024-06-20 19:58:49,569 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9858 conditions, 2495 events. 1671/2495 cut-off events. For 11723/11723 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11131 event pairs, 632 based on Foata normal form. 2/2496 useless extension candidates. Maximal degree in co-relation 9831. Up to 2465 conditions per place. 
[2024-06-20 19:58:49,578 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 69 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2024-06-20 19:58:49,579 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 634 flow
[2024-06-20 19:58:49,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:58:49,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:58:49,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 19:58:49,585 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3958333333333333
[2024-06-20 19:58:49,585 INFO  L175             Difference]: Start difference. First operand has 65 places, 68 transitions, 436 flow. Second operand 6 states and 95 transitions.
[2024-06-20 19:58:49,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 634 flow
[2024-06-20 19:58:49,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 605 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 19:58:49,596 INFO  L231             Difference]: Finished difference. Result has 68 places, 68 transitions, 437 flow
[2024-06-20 19:58:49,596 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=68, PETRI_TRANSITIONS=68}
[2024-06-20 19:58:49,596 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places.
[2024-06-20 19:58:49,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 437 flow
[2024-06-20 19:58:49,597 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:49,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:49,597 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:49,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:58:49,597 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:49,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:49,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 773388816, now seen corresponding path program 1 times
[2024-06-20 19:58:49,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:49,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27014154]
[2024-06-20 19:58:49,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:49,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:49,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:54,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:54,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:54,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27014154]
[2024-06-20 19:58:54,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27014154] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:54,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:54,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:58:54,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162845892]
[2024-06-20 19:58:54,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:54,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:58:54,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:54,777 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:58:54,777 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:58:54,882 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:54,883 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 437 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:54,883 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:54,883 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:54,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:55,711 INFO  L124   PetriNetUnfolderBase]: 1839/2734 cut-off events.
[2024-06-20 19:58:55,711 INFO  L125   PetriNetUnfolderBase]: For 14621/14625 co-relation queries the response was YES.
[2024-06-20 19:58:55,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10954 conditions, 2734 events. 1839/2734 cut-off events. For 14621/14625 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12355 event pairs, 541 based on Foata normal form. 16/2749 useless extension candidates. Maximal degree in co-relation 10926. Up to 2361 conditions per place. 
[2024-06-20 19:58:55,755 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 87 selfloop transitions, 34 changer transitions 0/124 dead transitions.
[2024-06-20 19:58:55,755 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 977 flow
[2024-06-20 19:58:55,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:58:55,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:58:55,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:58:55,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45625
[2024-06-20 19:58:55,757 INFO  L175             Difference]: Start difference. First operand has 68 places, 68 transitions, 437 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:58:55,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 977 flow
[2024-06-20 19:58:55,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 930 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 19:58:55,768 INFO  L231             Difference]: Finished difference. Result has 73 places, 87 transitions, 642 flow
[2024-06-20 19:58:55,768 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=73, PETRI_TRANSITIONS=87}
[2024-06-20 19:58:55,768 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places.
[2024-06-20 19:58:55,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 87 transitions, 642 flow
[2024-06-20 19:58:55,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:55,769 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:55,769 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:55,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:58:55,769 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:55,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:55,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -1129780498, now seen corresponding path program 2 times
[2024-06-20 19:58:55,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:55,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512718916]
[2024-06-20 19:58:55,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:55,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:55,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:00,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-20 19:59:00,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:00,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512718916]
[2024-06-20 19:59:00,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512718916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:00,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:00,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:00,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689277853]
[2024-06-20 19:59:00,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:00,462 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:00,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:00,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:00,463 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:00,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:00,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 87 transitions, 642 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:00,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:00,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:00,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:01,339 INFO  L124   PetriNetUnfolderBase]: 1875/2785 cut-off events.
[2024-06-20 19:59:01,339 INFO  L125   PetriNetUnfolderBase]: For 19613/19613 co-relation queries the response was YES.
[2024-06-20 19:59:01,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12928 conditions, 2785 events. 1875/2785 cut-off events. For 19613/19613 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12582 event pairs, 591 based on Foata normal form. 6/2790 useless extension candidates. Maximal degree in co-relation 12896. Up to 2647 conditions per place. 
[2024-06-20 19:59:01,355 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 96 selfloop transitions, 23 changer transitions 0/122 dead transitions.
[2024-06-20 19:59:01,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 1122 flow
[2024-06-20 19:59:01,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:59:01,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:59:01,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 19:59:01,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-20 19:59:01,357 INFO  L175             Difference]: Start difference. First operand has 73 places, 87 transitions, 642 flow. Second operand 7 states and 121 transitions.
[2024-06-20 19:59:01,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 1122 flow
[2024-06-20 19:59:01,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 122 transitions, 1072 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-20 19:59:01,371 INFO  L231             Difference]: Finished difference. Result has 79 places, 95 transitions, 744 flow
[2024-06-20 19:59:01,371 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=744, PETRI_PLACES=79, PETRI_TRANSITIONS=95}
[2024-06-20 19:59:01,372 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places.
[2024-06-20 19:59:01,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 744 flow
[2024-06-20 19:59:01,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:01,372 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:01,372 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:01,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:59:01,373 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:01,373 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:01,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 950757486, now seen corresponding path program 3 times
[2024-06-20 19:59:01,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:01,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55330830]
[2024-06-20 19:59:01,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:01,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:01,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:06,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:06,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:06,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55330830]
[2024-06-20 19:59:06,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55330830] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:06,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:06,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:06,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322105213]
[2024-06-20 19:59:06,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:06,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:06,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:06,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:06,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:06,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:06,474 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 744 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:06,474 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:06,474 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:06,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:07,325 INFO  L124   PetriNetUnfolderBase]: 1879/2791 cut-off events.
[2024-06-20 19:59:07,326 INFO  L125   PetriNetUnfolderBase]: For 23246/23246 co-relation queries the response was YES.
[2024-06-20 19:59:07,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13503 conditions, 2791 events. 1879/2791 cut-off events. For 23246/23246 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12618 event pairs, 591 based on Foata normal form. 6/2796 useless extension candidates. Maximal degree in co-relation 13468. Up to 2716 conditions per place. 
[2024-06-20 19:59:07,356 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 99 selfloop transitions, 23 changer transitions 0/125 dead transitions.
[2024-06-20 19:59:07,357 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 1152 flow
[2024-06-20 19:59:07,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:07,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:07,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions.
[2024-06-20 19:59:07,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38055555555555554
[2024-06-20 19:59:07,359 INFO  L175             Difference]: Start difference. First operand has 79 places, 95 transitions, 744 flow. Second operand 9 states and 137 transitions.
[2024-06-20 19:59:07,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 1152 flow
[2024-06-20 19:59:07,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 1114 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-20 19:59:07,378 INFO  L231             Difference]: Finished difference. Result has 87 places, 101 transitions, 837 flow
[2024-06-20 19:59:07,378 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=837, PETRI_PLACES=87, PETRI_TRANSITIONS=101}
[2024-06-20 19:59:07,380 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places.
[2024-06-20 19:59:07,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 837 flow
[2024-06-20 19:59:07,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:07,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:07,380 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:07,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:59:07,380 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:07,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:07,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 950766414, now seen corresponding path program 1 times
[2024-06-20 19:59:07,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:07,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856432851]
[2024-06-20 19:59:07,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:07,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:07,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:13,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:13,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:13,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856432851]
[2024-06-20 19:59:13,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856432851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:13,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:13,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:13,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969132647]
[2024-06-20 19:59:13,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:13,779 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:13,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:13,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:13,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:13,896 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:13,896 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 837 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:13,896 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:13,896 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:13,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:14,801 INFO  L124   PetriNetUnfolderBase]: 1882/2796 cut-off events.
[2024-06-20 19:59:14,801 INFO  L125   PetriNetUnfolderBase]: For 25730/25730 co-relation queries the response was YES.
[2024-06-20 19:59:14,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13843 conditions, 2796 events. 1882/2796 cut-off events. For 25730/25730 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12651 event pairs, 571 based on Foata normal form. 6/2801 useless extension candidates. Maximal degree in co-relation 13805. Up to 2701 conditions per place. 
[2024-06-20 19:59:14,835 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 98 selfloop transitions, 27 changer transitions 0/128 dead transitions.
[2024-06-20 19:59:14,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 128 transitions, 1225 flow
[2024-06-20 19:59:14,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:14,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:14,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-20 19:59:14,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-20 19:59:14,837 INFO  L175             Difference]: Start difference. First operand has 87 places, 101 transitions, 837 flow. Second operand 9 states and 138 transitions.
[2024-06-20 19:59:14,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 128 transitions, 1225 flow
[2024-06-20 19:59:14,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 128 transitions, 1155 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-20 19:59:14,853 INFO  L231             Difference]: Finished difference. Result has 89 places, 104 transitions, 867 flow
[2024-06-20 19:59:14,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=867, PETRI_PLACES=89, PETRI_TRANSITIONS=104}
[2024-06-20 19:59:14,853 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places.
[2024-06-20 19:59:14,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 104 transitions, 867 flow
[2024-06-20 19:59:14,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:14,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:14,854 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:14,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:59:14,854 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-20 19:59:14,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:14,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 450293065, now seen corresponding path program 1 times
[2024-06-20 19:59:14,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:14,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509412735]
[2024-06-20 19:59:14,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:14,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:14,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:21,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:21,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:21,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509412735]
[2024-06-20 19:59:21,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509412735] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:21,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:21,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:59:21,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110953791]
[2024-06-20 19:59:21,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:21,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:59:21,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:21,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:59:21,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:59:21,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:21,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 104 transitions, 867 flow. Second operand  has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:21,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:21,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:21,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:22,597 INFO  L124   PetriNetUnfolderBase]: 1879/2792 cut-off events.
[2024-06-20 19:59:22,597 INFO  L125   PetriNetUnfolderBase]: For 28055/28055 co-relation queries the response was YES.
[2024-06-20 19:59:22,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14223 conditions, 2792 events. 1879/2792 cut-off events. For 28055/28055 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12622 event pairs, 592 based on Foata normal form. 1/2792 useless extension candidates. Maximal degree in co-relation 14184. Up to 2777 conditions per place. 
[2024-06-20 19:59:22,616 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 101 selfloop transitions, 8 changer transitions 0/112 dead transitions.
[2024-06-20 19:59:22,616 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 112 transitions, 1105 flow
[2024-06-20 19:59:22,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:59:22,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:59:22,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions.
[2024-06-20 19:59:22,637 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.385
[2024-06-20 19:59:22,637 INFO  L175             Difference]: Start difference. First operand has 89 places, 104 transitions, 867 flow. Second operand 5 states and 77 transitions.
[2024-06-20 19:59:22,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 112 transitions, 1105 flow
[2024-06-20 19:59:22,657 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 112 transitions, 1017 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 19:59:22,659 INFO  L231             Difference]: Finished difference. Result has 87 places, 104 transitions, 801 flow
[2024-06-20 19:59:22,660 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=801, PETRI_PLACES=87, PETRI_TRANSITIONS=104}
[2024-06-20 19:59:22,661 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places.
[2024-06-20 19:59:22,661 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 801 flow
[2024-06-20 19:59:22,661 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:22,661 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:22,661 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:22,662 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:59:22,662 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:22,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:22,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 857215989, now seen corresponding path program 1 times
[2024-06-20 19:59:22,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:22,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957707304]
[2024-06-20 19:59:22,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:22,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:22,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:27,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:27,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:27,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957707304]
[2024-06-20 19:59:27,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957707304] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:27,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:27,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:27,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793378938]
[2024-06-20 19:59:27,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:27,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:27,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:27,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:27,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:27,958 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:27,958 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 801 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:27,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:27,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:27,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:28,772 INFO  L124   PetriNetUnfolderBase]: 1890/2809 cut-off events.
[2024-06-20 19:59:28,772 INFO  L125   PetriNetUnfolderBase]: For 30829/30835 co-relation queries the response was YES.
[2024-06-20 19:59:28,779 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14350 conditions, 2809 events. 1890/2809 cut-off events. For 30829/30835 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12739 event pairs, 578 based on Foata normal form. 8/2816 useless extension candidates. Maximal degree in co-relation 14310. Up to 2672 conditions per place. 
[2024-06-20 19:59:28,788 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 108 selfloop transitions, 26 changer transitions 0/137 dead transitions.
[2024-06-20 19:59:28,788 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 1271 flow
[2024-06-20 19:59:28,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:59:28,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:59:28,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 19:59:28,790 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-20 19:59:28,790 INFO  L175             Difference]: Start difference. First operand has 87 places, 104 transitions, 801 flow. Second operand 7 states and 121 transitions.
[2024-06-20 19:59:28,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 1271 flow
[2024-06-20 19:59:28,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1255 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-20 19:59:28,810 INFO  L231             Difference]: Finished difference. Result has 90 places, 110 transitions, 931 flow
[2024-06-20 19:59:28,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=931, PETRI_PLACES=90, PETRI_TRANSITIONS=110}
[2024-06-20 19:59:28,810 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2024-06-20 19:59:28,811 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 110 transitions, 931 flow
[2024-06-20 19:59:28,811 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:28,811 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:28,811 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:28,811 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:59:28,811 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:28,812 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:28,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -1798474475, now seen corresponding path program 2 times
[2024-06-20 19:59:28,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:28,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965564697]
[2024-06-20 19:59:28,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:28,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:28,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:34,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:34,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:34,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965564697]
[2024-06-20 19:59:34,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965564697] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:34,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:34,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:34,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571642307]
[2024-06-20 19:59:34,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:34,019 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:34,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:34,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:34,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:34,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:34,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 110 transitions, 931 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:34,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:34,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:34,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:34,926 INFO  L124   PetriNetUnfolderBase]: 1885/2802 cut-off events.
[2024-06-20 19:59:34,926 INFO  L125   PetriNetUnfolderBase]: For 35095/35101 co-relation queries the response was YES.
[2024-06-20 19:59:34,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14913 conditions, 2802 events. 1885/2802 cut-off events. For 35095/35101 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12706 event pairs, 578 based on Foata normal form. 8/2809 useless extension candidates. Maximal degree in co-relation 14872. Up to 2700 conditions per place. 
[2024-06-20 19:59:34,946 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 107 selfloop transitions, 22 changer transitions 0/132 dead transitions.
[2024-06-20 19:59:34,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 132 transitions, 1245 flow
[2024-06-20 19:59:34,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:59:34,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:59:34,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-20 19:59:34,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-20 19:59:34,949 INFO  L175             Difference]: Start difference. First operand has 90 places, 110 transitions, 931 flow. Second operand 7 states and 116 transitions.
[2024-06-20 19:59:34,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 132 transitions, 1245 flow
[2024-06-20 19:59:34,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 1164 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-20 19:59:34,974 INFO  L231             Difference]: Finished difference. Result has 94 places, 110 transitions, 902 flow
[2024-06-20 19:59:34,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=902, PETRI_PLACES=94, PETRI_TRANSITIONS=110}
[2024-06-20 19:59:34,975 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places.
[2024-06-20 19:59:34,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 110 transitions, 902 flow
[2024-06-20 19:59:34,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:34,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:34,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:34,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:59:34,976 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:34,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:34,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -797941636, now seen corresponding path program 1 times
[2024-06-20 19:59:34,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:34,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164303546]
[2024-06-20 19:59:34,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:34,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:35,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:40,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:40,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:40,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164303546]
[2024-06-20 19:59:40,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164303546] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:40,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:40,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:40,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545604312]
[2024-06-20 19:59:40,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:40,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:40,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:40,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:40,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:40,519 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:40,519 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 110 transitions, 902 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:40,519 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:40,519 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:40,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:41,397 INFO  L124   PetriNetUnfolderBase]: 1969/2922 cut-off events.
[2024-06-20 19:59:41,398 INFO  L125   PetriNetUnfolderBase]: For 40207/40213 co-relation queries the response was YES.
[2024-06-20 19:59:41,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15814 conditions, 2922 events. 1969/2922 cut-off events. For 40207/40213 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13276 event pairs, 532 based on Foata normal form. 12/2933 useless extension candidates. Maximal degree in co-relation 15771. Up to 2461 conditions per place. 
[2024-06-20 19:59:41,419 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 102 selfloop transitions, 50 changer transitions 0/155 dead transitions.
[2024-06-20 19:59:41,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 155 transitions, 1592 flow
[2024-06-20 19:59:41,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:41,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:41,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-20 19:59:41,422 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453125
[2024-06-20 19:59:41,422 INFO  L175             Difference]: Start difference. First operand has 94 places, 110 transitions, 902 flow. Second operand 8 states and 145 transitions.
[2024-06-20 19:59:41,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 155 transitions, 1592 flow
[2024-06-20 19:59:41,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 155 transitions, 1537 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:41,464 INFO  L231             Difference]: Finished difference. Result has 98 places, 119 transitions, 1115 flow
[2024-06-20 19:59:41,464 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1115, PETRI_PLACES=98, PETRI_TRANSITIONS=119}
[2024-06-20 19:59:41,464 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places.
[2024-06-20 19:59:41,465 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 1115 flow
[2024-06-20 19:59:41,465 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:41,465 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:41,465 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:41,465 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:59:41,465 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:41,466 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:41,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -1794755250, now seen corresponding path program 2 times
[2024-06-20 19:59:41,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:41,466 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792140037]
[2024-06-20 19:59:41,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:41,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:41,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:46,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:46,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:46,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792140037]
[2024-06-20 19:59:46,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792140037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:46,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:46,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:46,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540090492]
[2024-06-20 19:59:46,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:46,374 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:46,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:46,375 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:46,375 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:46,499 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:46,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 1115 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:46,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:46,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:46,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:47,367 INFO  L124   PetriNetUnfolderBase]: 1957/2906 cut-off events.
[2024-06-20 19:59:47,367 INFO  L125   PetriNetUnfolderBase]: For 45728/45734 co-relation queries the response was YES.
[2024-06-20 19:59:47,375 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16703 conditions, 2906 events. 1957/2906 cut-off events. For 45728/45734 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13229 event pairs, 532 based on Foata normal form. 12/2917 useless extension candidates. Maximal degree in co-relation 16657. Up to 2455 conditions per place. 
[2024-06-20 19:59:47,382 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 103 selfloop transitions, 53 changer transitions 0/159 dead transitions.
[2024-06-20 19:59:47,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 1721 flow
[2024-06-20 19:59:47,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:47,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:47,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-20 19:59:47,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625
[2024-06-20 19:59:47,406 INFO  L175             Difference]: Start difference. First operand has 98 places, 119 transitions, 1115 flow. Second operand 8 states and 148 transitions.
[2024-06-20 19:59:47,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 1721 flow
[2024-06-20 19:59:47,456 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 159 transitions, 1620 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-20 19:59:47,460 INFO  L231             Difference]: Finished difference. Result has 104 places, 122 transitions, 1223 flow
[2024-06-20 19:59:47,460 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1223, PETRI_PLACES=104, PETRI_TRANSITIONS=122}
[2024-06-20 19:59:47,461 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places.
[2024-06-20 19:59:47,461 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 122 transitions, 1223 flow
[2024-06-20 19:59:47,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:47,462 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:47,462 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:47,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:59:47,462 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:47,462 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:47,462 INFO  L85        PathProgramCache]: Analyzing trace with hash 175769232, now seen corresponding path program 3 times
[2024-06-20 19:59:47,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:47,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135035601]
[2024-06-20 19:59:47,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:47,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:47,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:52,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:52,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:52,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135035601]
[2024-06-20 19:59:52,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135035601] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:52,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:52,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:59:52,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032300183]
[2024-06-20 19:59:52,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:52,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:59:52,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:52,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:59:52,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:59:52,585 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:52,585 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 122 transitions, 1223 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:52,585 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:52,585 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:52,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:53,427 INFO  L124   PetriNetUnfolderBase]: 1961/2912 cut-off events.
[2024-06-20 19:59:53,427 INFO  L125   PetriNetUnfolderBase]: For 49788/49794 co-relation queries the response was YES.
[2024-06-20 19:59:53,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17278 conditions, 2912 events. 1961/2912 cut-off events. For 49788/49794 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13240 event pairs, 575 based on Foata normal form. 12/2923 useless extension candidates. Maximal degree in co-relation 17229. Up to 2804 conditions per place. 
[2024-06-20 19:59:53,447 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 121 selfloop transitions, 25 changer transitions 0/149 dead transitions.
[2024-06-20 19:59:53,447 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 149 transitions, 1675 flow
[2024-06-20 19:59:53,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:53,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:53,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-20 19:59:53,449 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.403125
[2024-06-20 19:59:53,449 INFO  L175             Difference]: Start difference. First operand has 104 places, 122 transitions, 1223 flow. Second operand 8 states and 129 transitions.
[2024-06-20 19:59:53,449 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 149 transitions, 1675 flow
[2024-06-20 19:59:53,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 149 transitions, 1569 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:53,481 INFO  L231             Difference]: Finished difference. Result has 106 places, 126 transitions, 1248 flow
[2024-06-20 19:59:53,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1248, PETRI_PLACES=106, PETRI_TRANSITIONS=126}
[2024-06-20 19:59:53,482 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places.
[2024-06-20 19:59:53,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 126 transitions, 1248 flow
[2024-06-20 19:59:53,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:53,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:53,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:53,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:59:53,483 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:53,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:53,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 175776889, now seen corresponding path program 1 times
[2024-06-20 19:59:53,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:53,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73944001]
[2024-06-20 19:59:53,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:53,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:53,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:58,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:58,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:58,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73944001]
[2024-06-20 19:59:58,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73944001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:58,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:58,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:59:58,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506875899]
[2024-06-20 19:59:58,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:58,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:59:58,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:58,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:59:58,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:59:58,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:58,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 126 transitions, 1248 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:58,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:58,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:58,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:59,518 INFO  L124   PetriNetUnfolderBase]: 1963/2914 cut-off events.
[2024-06-20 19:59:59,518 INFO  L125   PetriNetUnfolderBase]: For 52696/52696 co-relation queries the response was YES.
[2024-06-20 19:59:59,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17188 conditions, 2914 events. 1963/2914 cut-off events. For 52696/52696 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13299 event pairs, 562 based on Foata normal form. 3/2916 useless extension candidates. Maximal degree in co-relation 17139. Up to 2808 conditions per place. 
[2024-06-20 19:59:59,533 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 118 selfloop transitions, 32 changer transitions 0/153 dead transitions.
[2024-06-20 19:59:59,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 153 transitions, 1700 flow
[2024-06-20 19:59:59,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:59,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:59,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-20 19:59:59,541 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-20 19:59:59,542 INFO  L175             Difference]: Start difference. First operand has 106 places, 126 transitions, 1248 flow. Second operand 9 states and 138 transitions.
[2024-06-20 19:59:59,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 153 transitions, 1700 flow
[2024-06-20 19:59:59,572 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 153 transitions, 1627 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:59,574 INFO  L231             Difference]: Finished difference. Result has 109 places, 130 transitions, 1317 flow
[2024-06-20 19:59:59,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1317, PETRI_PLACES=109, PETRI_TRANSITIONS=130}
[2024-06-20 19:59:59,574 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places.
[2024-06-20 19:59:59,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 130 transitions, 1317 flow
[2024-06-20 19:59:59,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:59,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:59,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:59,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:59:59,575 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-20 19:59:59,576 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:59,576 INFO  L85        PathProgramCache]: Analyzing trace with hash 1074184849, now seen corresponding path program 1 times
[2024-06-20 19:59:59,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:59,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319373702]
[2024-06-20 19:59:59,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:59,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:59,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:07,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:07,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:07,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319373702]
[2024-06-20 20:00:07,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319373702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:07,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:07,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:00:07,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765755578]
[2024-06-20 20:00:07,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:07,960 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:00:07,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:07,961 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:00:07,961 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:00:08,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:08,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 130 transitions, 1317 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:08,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:08,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:08,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:08,761 INFO  L124   PetriNetUnfolderBase]: 1957/2906 cut-off events.
[2024-06-20 20:00:08,761 INFO  L125   PetriNetUnfolderBase]: For 56141/56141 co-relation queries the response was YES.
[2024-06-20 20:00:08,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17699 conditions, 2906 events. 1957/2906 cut-off events. For 56141/56141 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13141 event pairs, 573 based on Foata normal form. 2/2907 useless extension candidates. Maximal degree in co-relation 17649. Up to 2885 conditions per place. 
[2024-06-20 20:00:08,781 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 129 selfloop transitions, 11 changer transitions 0/143 dead transitions.
[2024-06-20 20:00:08,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 143 transitions, 1647 flow
[2024-06-20 20:00:08,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:00:08,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:00:08,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions.
[2024-06-20 20:00:08,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37083333333333335
[2024-06-20 20:00:08,782 INFO  L175             Difference]: Start difference. First operand has 109 places, 130 transitions, 1317 flow. Second operand 6 states and 89 transitions.
[2024-06-20 20:00:08,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 143 transitions, 1647 flow
[2024-06-20 20:00:08,814 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 143 transitions, 1555 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 20:00:08,816 INFO  L231             Difference]: Finished difference. Result has 108 places, 133 transitions, 1285 flow
[2024-06-20 20:00:08,816 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1285, PETRI_PLACES=108, PETRI_TRANSITIONS=133}
[2024-06-20 20:00:08,817 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places.
[2024-06-20 20:00:08,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 1285 flow
[2024-06-20 20:00:08,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:08,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:08,817 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:08,817 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 20:00:08,817 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:08,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:08,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 928475023, now seen corresponding path program 1 times
[2024-06-20 20:00:08,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:08,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965682048]
[2024-06-20 20:00:08,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:08,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:08,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:14,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:14,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:14,810 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965682048]
[2024-06-20 20:00:14,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965682048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:14,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:14,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:14,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578962381]
[2024-06-20 20:00:14,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:14,811 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:14,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:14,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:14,811 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:15,038 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:15,038 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 1285 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:15,038 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:15,038 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:15,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:15,919 INFO  L124   PetriNetUnfolderBase]: 1974/2934 cut-off events.
[2024-06-20 20:00:15,919 INFO  L125   PetriNetUnfolderBase]: For 61079/61085 co-relation queries the response was YES.
[2024-06-20 20:00:15,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18192 conditions, 2934 events. 1974/2934 cut-off events. For 61079/61085 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13370 event pairs, 418 based on Foata normal form. 10/2943 useless extension candidates. Maximal degree in co-relation 18141. Up to 2699 conditions per place. 
[2024-06-20 20:00:15,942 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 135 selfloop transitions, 32 changer transitions 0/170 dead transitions.
[2024-06-20 20:00:15,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 170 transitions, 1877 flow
[2024-06-20 20:00:15,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:00:15,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:00:15,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-20 20:00:15,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 20:00:15,945 INFO  L175             Difference]: Start difference. First operand has 108 places, 133 transitions, 1285 flow. Second operand 8 states and 136 transitions.
[2024-06-20 20:00:15,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 170 transitions, 1877 flow
[2024-06-20 20:00:15,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 170 transitions, 1839 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 20:00:15,983 INFO  L231             Difference]: Finished difference. Result has 112 places, 137 transitions, 1418 flow
[2024-06-20 20:00:15,983 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1418, PETRI_PLACES=112, PETRI_TRANSITIONS=137}
[2024-06-20 20:00:15,984 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places.
[2024-06-20 20:00:15,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 137 transitions, 1418 flow
[2024-06-20 20:00:15,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:15,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:15,985 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:15,985 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 20:00:15,990 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:15,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:15,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 928535473, now seen corresponding path program 2 times
[2024-06-20 20:00:15,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:15,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105470930]
[2024-06-20 20:00:15,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:15,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:16,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:21,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:21,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:21,825 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105470930]
[2024-06-20 20:00:21,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105470930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:21,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:21,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:21,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009567554]
[2024-06-20 20:00:21,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:21,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:21,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:21,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:21,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:21,952 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:21,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 137 transitions, 1418 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:21,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:21,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:21,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:23,020 INFO  L124   PetriNetUnfolderBase]: 1991/2961 cut-off events.
[2024-06-20 20:00:23,021 INFO  L125   PetriNetUnfolderBase]: For 67620/67626 co-relation queries the response was YES.
[2024-06-20 20:00:23,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18875 conditions, 2961 events. 1991/2961 cut-off events. For 67620/67626 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13547 event pairs, 541 based on Foata normal form. 10/2970 useless extension candidates. Maximal degree in co-relation 18823. Up to 2808 conditions per place. 
[2024-06-20 20:00:23,041 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 138 selfloop transitions, 28 changer transitions 0/169 dead transitions.
[2024-06-20 20:00:23,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 169 transitions, 1878 flow
[2024-06-20 20:00:23,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:00:23,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:00:23,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-20 20:00:23,043 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415625
[2024-06-20 20:00:23,043 INFO  L175             Difference]: Start difference. First operand has 112 places, 137 transitions, 1418 flow. Second operand 8 states and 133 transitions.
[2024-06-20 20:00:23,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 169 transitions, 1878 flow
[2024-06-20 20:00:23,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 169 transitions, 1772 flow, removed 38 selfloop flow, removed 4 redundant places.
[2024-06-20 20:00:23,092 INFO  L231             Difference]: Finished difference. Result has 116 places, 139 transitions, 1431 flow
[2024-06-20 20:00:23,093 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1431, PETRI_PLACES=116, PETRI_TRANSITIONS=139}
[2024-06-20 20:00:23,093 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places.
[2024-06-20 20:00:23,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 139 transitions, 1431 flow
[2024-06-20 20:00:23,093 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:23,094 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:23,094 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:23,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 20:00:23,094 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:23,094 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:23,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 928535597, now seen corresponding path program 1 times
[2024-06-20 20:00:23,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:23,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330731128]
[2024-06-20 20:00:23,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:23,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:23,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:28,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:28,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:28,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330731128]
[2024-06-20 20:00:28,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330731128] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:28,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:28,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:28,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100798385]
[2024-06-20 20:00:28,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:28,682 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:28,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:28,683 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:28,683 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:28,799 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:28,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 139 transitions, 1431 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:28,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:28,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:28,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:29,865 INFO  L124   PetriNetUnfolderBase]: 2075/3080 cut-off events.
[2024-06-20 20:00:29,866 INFO  L125   PetriNetUnfolderBase]: For 74452/74458 co-relation queries the response was YES.
[2024-06-20 20:00:29,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19692 conditions, 3080 events. 2075/3080 cut-off events. For 74452/74458 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14277 event pairs, 451 based on Foata normal form. 12/3091 useless extension candidates. Maximal degree in co-relation 19638. Up to 2406 conditions per place. 
[2024-06-20 20:00:29,886 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 133 selfloop transitions, 59 changer transitions 0/195 dead transitions.
[2024-06-20 20:00:29,887 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 195 transitions, 2345 flow
[2024-06-20 20:00:29,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:29,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:29,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 20:00:29,888 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46111111111111114
[2024-06-20 20:00:29,888 INFO  L175             Difference]: Start difference. First operand has 116 places, 139 transitions, 1431 flow. Second operand 9 states and 166 transitions.
[2024-06-20 20:00:29,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 195 transitions, 2345 flow
[2024-06-20 20:00:29,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 195 transitions, 2264 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-20 20:00:29,945 INFO  L231             Difference]: Finished difference. Result has 121 places, 151 transitions, 1656 flow
[2024-06-20 20:00:29,945 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1656, PETRI_PLACES=121, PETRI_TRANSITIONS=151}
[2024-06-20 20:00:29,945 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places.
[2024-06-20 20:00:29,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 151 transitions, 1656 flow
[2024-06-20 20:00:29,946 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:29,946 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:29,946 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:29,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 20:00:29,946 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:29,946 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:29,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 81871769, now seen corresponding path program 2 times
[2024-06-20 20:00:29,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:29,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277486492]
[2024-06-20 20:00:29,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:29,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:29,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:35,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:35,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:35,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277486492]
[2024-06-20 20:00:35,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277486492] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:35,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:35,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:35,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055686754]
[2024-06-20 20:00:35,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:35,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:35,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:35,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:35,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:35,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:35,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 151 transitions, 1656 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:35,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:35,723 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:35,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:36,747 INFO  L124   PetriNetUnfolderBase]: 2111/3132 cut-off events.
[2024-06-20 20:00:36,747 INFO  L125   PetriNetUnfolderBase]: For 83477/83483 co-relation queries the response was YES.
[2024-06-20 20:00:36,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21140 conditions, 3132 events. 2111/3132 cut-off events. For 83477/83483 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14517 event pairs, 471 based on Foata normal form. 12/3143 useless extension candidates. Maximal degree in co-relation 21083. Up to 2650 conditions per place. 
[2024-06-20 20:00:36,771 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 133 selfloop transitions, 56 changer transitions 0/192 dead transitions.
[2024-06-20 20:00:36,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 192 transitions, 2345 flow
[2024-06-20 20:00:36,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:36,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:36,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-20 20:00:36,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44722222222222224
[2024-06-20 20:00:36,773 INFO  L175             Difference]: Start difference. First operand has 121 places, 151 transitions, 1656 flow. Second operand 9 states and 161 transitions.
[2024-06-20 20:00:36,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 192 transitions, 2345 flow
[2024-06-20 20:00:36,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 192 transitions, 2208 flow, removed 43 selfloop flow, removed 4 redundant places.
[2024-06-20 20:00:36,849 INFO  L231             Difference]: Finished difference. Result has 126 places, 155 transitions, 1717 flow
[2024-06-20 20:00:36,850 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1717, PETRI_PLACES=126, PETRI_TRANSITIONS=155}
[2024-06-20 20:00:36,854 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 85 predicate places.
[2024-06-20 20:00:36,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 155 transitions, 1717 flow
[2024-06-20 20:00:36,855 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:36,855 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:36,855 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:36,855 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 20:00:36,856 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:36,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:36,856 INFO  L85        PathProgramCache]: Analyzing trace with hash 931331983, now seen corresponding path program 3 times
[2024-06-20 20:00:36,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:36,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753755042]
[2024-06-20 20:00:36,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:36,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:36,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:43,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:43,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:43,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753755042]
[2024-06-20 20:00:43,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753755042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:43,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:43,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:43,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504924619]
[2024-06-20 20:00:43,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:43,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:43,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:43,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:43,138 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:43,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:43,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 155 transitions, 1717 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:43,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:43,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:43,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:44,159 INFO  L124   PetriNetUnfolderBase]: 2103/3120 cut-off events.
[2024-06-20 20:00:44,159 INFO  L125   PetriNetUnfolderBase]: For 87281/87287 co-relation queries the response was YES.
[2024-06-20 20:00:44,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21466 conditions, 3120 events. 2103/3120 cut-off events. For 87281/87287 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14362 event pairs, 543 based on Foata normal form. 10/3129 useless extension candidates. Maximal degree in co-relation 21407. Up to 3000 conditions per place. 
[2024-06-20 20:00:44,186 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 155 selfloop transitions, 24 changer transitions 0/182 dead transitions.
[2024-06-20 20:00:44,186 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 182 transitions, 2143 flow
[2024-06-20 20:00:44,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:00:44,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:00:44,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions.
[2024-06-20 20:00:44,189 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40625
[2024-06-20 20:00:44,189 INFO  L175             Difference]: Start difference. First operand has 126 places, 155 transitions, 1717 flow. Second operand 8 states and 130 transitions.
[2024-06-20 20:00:44,189 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 182 transitions, 2143 flow
[2024-06-20 20:00:44,272 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 182 transitions, 1968 flow, removed 34 selfloop flow, removed 7 redundant places.
[2024-06-20 20:00:44,274 INFO  L231             Difference]: Finished difference. Result has 127 places, 155 transitions, 1597 flow
[2024-06-20 20:00:44,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1597, PETRI_PLACES=127, PETRI_TRANSITIONS=155}
[2024-06-20 20:00:44,276 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places.
[2024-06-20 20:00:44,276 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 155 transitions, 1597 flow
[2024-06-20 20:00:44,276 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:44,276 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:44,280 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:44,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 20:00:44,280 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:44,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:44,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 81867119, now seen corresponding path program 3 times
[2024-06-20 20:00:44,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:44,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755504858]
[2024-06-20 20:00:44,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:44,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:44,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:50,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:50,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:50,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755504858]
[2024-06-20 20:00:50,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755504858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:50,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:50,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:50,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767940940]
[2024-06-20 20:00:50,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:50,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:50,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:50,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:50,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:50,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:50,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 155 transitions, 1597 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:50,191 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:50,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:50,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:51,248 INFO  L124   PetriNetUnfolderBase]: 2335/3443 cut-off events.
[2024-06-20 20:00:51,249 INFO  L125   PetriNetUnfolderBase]: For 102305/102311 co-relation queries the response was YES.
[2024-06-20 20:00:51,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23341 conditions, 3443 events. 2335/3443 cut-off events. For 102305/102311 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16041 event pairs, 504 based on Foata normal form. 16/3458 useless extension candidates. Maximal degree in co-relation 23281. Up to 2396 conditions per place. 
[2024-06-20 20:00:51,272 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 157 selfloop transitions, 71 changer transitions 0/231 dead transitions.
[2024-06-20 20:00:51,273 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 231 transitions, 2811 flow
[2024-06-20 20:00:51,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:51,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:51,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-20 20:00:51,274 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48333333333333334
[2024-06-20 20:00:51,274 INFO  L175             Difference]: Start difference. First operand has 127 places, 155 transitions, 1597 flow. Second operand 9 states and 174 transitions.
[2024-06-20 20:00:51,274 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 231 transitions, 2811 flow
[2024-06-20 20:00:51,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 231 transitions, 2748 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 20:00:51,349 INFO  L231             Difference]: Finished difference. Result has 133 places, 180 transitions, 2058 flow
[2024-06-20 20:00:51,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2058, PETRI_PLACES=133, PETRI_TRANSITIONS=180}
[2024-06-20 20:00:51,350 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 92 predicate places.
[2024-06-20 20:00:51,350 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 180 transitions, 2058 flow
[2024-06-20 20:00:51,350 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:51,350 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:51,351 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:51,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 20:00:51,351 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:51,351 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:51,351 INFO  L85        PathProgramCache]: Analyzing trace with hash 197158289, now seen corresponding path program 4 times
[2024-06-20 20:00:51,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:51,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135689974]
[2024-06-20 20:00:51,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:51,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:51,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:57,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:57,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:57,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135689974]
[2024-06-20 20:00:57,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135689974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:57,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:57,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:57,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645543777]
[2024-06-20 20:00:57,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:57,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:57,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:57,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:57,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:57,407 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:57,407 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 180 transitions, 2058 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:57,407 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:57,407 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:57,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:58,683 INFO  L124   PetriNetUnfolderBase]: 2463/3623 cut-off events.
[2024-06-20 20:00:58,683 INFO  L125   PetriNetUnfolderBase]: For 119744/119750 co-relation queries the response was YES.
[2024-06-20 20:00:58,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26641 conditions, 3623 events. 2463/3623 cut-off events. For 119744/119750 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16996 event pairs, 482 based on Foata normal form. 16/3638 useless extension candidates. Maximal degree in co-relation 26576. Up to 2485 conditions per place. 
[2024-06-20 20:00:58,714 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 173 selfloop transitions, 80 changer transitions 0/256 dead transitions.
[2024-06-20 20:00:58,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 256 transitions, 3433 flow
[2024-06-20 20:00:58,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:58,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:58,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-20 20:00:58,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5055555555555555
[2024-06-20 20:00:58,716 INFO  L175             Difference]: Start difference. First operand has 133 places, 180 transitions, 2058 flow. Second operand 9 states and 182 transitions.
[2024-06-20 20:00:58,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 256 transitions, 3433 flow
[2024-06-20 20:00:58,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 256 transitions, 3331 flow, removed 47 selfloop flow, removed 2 redundant places.
[2024-06-20 20:00:58,817 INFO  L231             Difference]: Finished difference. Result has 143 places, 197 transitions, 2481 flow
[2024-06-20 20:00:58,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2481, PETRI_PLACES=143, PETRI_TRANSITIONS=197}
[2024-06-20 20:00:58,817 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places.
[2024-06-20 20:00:58,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 197 transitions, 2481 flow
[2024-06-20 20:00:58,818 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:58,818 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:58,818 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:58,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 20:00:58,818 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:58,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:58,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 1046807851, now seen corresponding path program 1 times
[2024-06-20 20:00:58,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:58,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098044660]
[2024-06-20 20:00:58,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:58,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:58,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:04,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:04,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:04,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098044660]
[2024-06-20 20:01:04,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098044660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:04,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:04,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:01:04,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713888853]
[2024-06-20 20:01:04,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:04,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:01:04,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:04,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:01:04,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:01:04,916 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:04,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 197 transitions, 2481 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:04,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:04,917 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:04,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:06,139 INFO  L124   PetriNetUnfolderBase]: 2519/3711 cut-off events.
[2024-06-20 20:01:06,139 INFO  L125   PetriNetUnfolderBase]: For 135523/135529 co-relation queries the response was YES.
[2024-06-20 20:01:06,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29146 conditions, 3711 events. 2519/3711 cut-off events. For 135523/135529 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17676 event pairs, 498 based on Foata normal form. 18/3728 useless extension candidates. Maximal degree in co-relation 29076. Up to 3211 conditions per place. 
[2024-06-20 20:01:06,170 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 179 selfloop transitions, 56 changer transitions 0/238 dead transitions.
[2024-06-20 20:01:06,171 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 238 transitions, 3297 flow
[2024-06-20 20:01:06,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:01:06,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:01:06,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-20 20:01:06,172 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44722222222222224
[2024-06-20 20:01:06,172 INFO  L175             Difference]: Start difference. First operand has 143 places, 197 transitions, 2481 flow. Second operand 9 states and 161 transitions.
[2024-06-20 20:01:06,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 238 transitions, 3297 flow
[2024-06-20 20:01:06,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 238 transitions, 3154 flow, removed 60 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:06,295 INFO  L231             Difference]: Finished difference. Result has 149 places, 201 transitions, 2549 flow
[2024-06-20 20:01:06,295 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2549, PETRI_PLACES=149, PETRI_TRANSITIONS=201}
[2024-06-20 20:01:06,296 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places.
[2024-06-20 20:01:06,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 201 transitions, 2549 flow
[2024-06-20 20:01:06,296 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:06,297 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:06,297 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:06,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 20:01:06,297 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:06,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:06,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 197162939, now seen corresponding path program 5 times
[2024-06-20 20:01:06,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:06,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048365917]
[2024-06-20 20:01:06,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:06,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:06,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:12,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:12,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:12,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048365917]
[2024-06-20 20:01:12,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048365917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:12,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:12,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:01:12,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457445774]
[2024-06-20 20:01:12,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:12,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:01:12,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:12,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:01:12,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:01:12,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:12,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 201 transitions, 2549 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:12,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:12,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:12,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:13,547 INFO  L124   PetriNetUnfolderBase]: 2555/3763 cut-off events.
[2024-06-20 20:01:13,547 INFO  L125   PetriNetUnfolderBase]: For 140442/140448 co-relation queries the response was YES.
[2024-06-20 20:01:13,565 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29907 conditions, 3763 events. 2555/3763 cut-off events. For 140442/140448 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17913 event pairs, 473 based on Foata normal form. 12/3774 useless extension candidates. Maximal degree in co-relation 29835. Up to 3281 conditions per place. 
[2024-06-20 20:01:13,582 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 182 selfloop transitions, 60 changer transitions 0/245 dead transitions.
[2024-06-20 20:01:13,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 245 transitions, 3397 flow
[2024-06-20 20:01:13,583 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:01:13,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:01:13,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 20:01:13,584 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4527777777777778
[2024-06-20 20:01:13,584 INFO  L175             Difference]: Start difference. First operand has 149 places, 201 transitions, 2549 flow. Second operand 9 states and 163 transitions.
[2024-06-20 20:01:13,584 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 245 transitions, 3397 flow
[2024-06-20 20:01:13,714 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 245 transitions, 3220 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:13,717 INFO  L231             Difference]: Finished difference. Result has 151 places, 205 transitions, 2593 flow
[2024-06-20 20:01:13,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2593, PETRI_PLACES=151, PETRI_TRANSITIONS=205}
[2024-06-20 20:01:13,718 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places.
[2024-06-20 20:01:13,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 205 transitions, 2593 flow
[2024-06-20 20:01:13,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:13,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:13,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:13,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 20:01:13,719 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:13,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:13,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 1046800907, now seen corresponding path program 6 times
[2024-06-20 20:01:13,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:13,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681630892]
[2024-06-20 20:01:13,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:13,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:13,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:19,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:19,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:19,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681630892]
[2024-06-20 20:01:19,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681630892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:19,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:19,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:01:19,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378718504]
[2024-06-20 20:01:19,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:19,843 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:01:19,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:19,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:01:19,844 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:01:19,929 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:19,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 205 transitions, 2593 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:19,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:19,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:19,937 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:21,084 INFO  L124   PetriNetUnfolderBase]: 2591/3815 cut-off events.
[2024-06-20 20:01:21,084 INFO  L125   PetriNetUnfolderBase]: For 149585/149591 co-relation queries the response was YES.
[2024-06-20 20:01:21,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30393 conditions, 3815 events. 2591/3815 cut-off events. For 149585/149591 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18209 event pairs, 475 based on Foata normal form. 12/3826 useless extension candidates. Maximal degree in co-relation 30320. Up to 3333 conditions per place. 
[2024-06-20 20:01:21,121 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 184 selfloop transitions, 58 changer transitions 0/245 dead transitions.
[2024-06-20 20:01:21,121 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 245 transitions, 3385 flow
[2024-06-20 20:01:21,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:01:21,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:01:21,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-20 20:01:21,124 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4388888888888889
[2024-06-20 20:01:21,124 INFO  L175             Difference]: Start difference. First operand has 151 places, 205 transitions, 2593 flow. Second operand 9 states and 158 transitions.
[2024-06-20 20:01:21,124 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 245 transitions, 3385 flow
[2024-06-20 20:01:21,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 245 transitions, 3212 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:21,263 INFO  L231             Difference]: Finished difference. Result has 153 places, 209 transitions, 2645 flow
[2024-06-20 20:01:21,263 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2645, PETRI_PLACES=153, PETRI_TRANSITIONS=209}
[2024-06-20 20:01:21,264 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places.
[2024-06-20 20:01:21,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 209 transitions, 2645 flow
[2024-06-20 20:01:21,264 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:21,264 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:21,264 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:21,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 20:01:21,265 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:21,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:21,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 1865943402, now seen corresponding path program 1 times
[2024-06-20 20:01:21,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:21,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916436564]
[2024-06-20 20:01:21,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:21,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:21,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:27,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:27,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:27,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916436564]
[2024-06-20 20:01:27,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916436564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:27,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:27,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:01:27,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109395385]
[2024-06-20 20:01:27,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:27,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:01:27,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:27,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:01:27,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:01:27,526 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:27,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 209 transitions, 2645 flow. Second operand  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:27,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:27,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:27,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:28,532 INFO  L124   PetriNetUnfolderBase]: 2596/3821 cut-off events.
[2024-06-20 20:01:28,532 INFO  L125   PetriNetUnfolderBase]: For 154926/154926 co-relation queries the response was YES.
[2024-06-20 20:01:28,551 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30676 conditions, 3821 events. 2596/3821 cut-off events. For 154926/154926 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18164 event pairs, 630 based on Foata normal form. 1/3821 useless extension candidates. Maximal degree in co-relation 30602. Up to 3784 conditions per place. 
[2024-06-20 20:01:28,567 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 209 selfloop transitions, 16 changer transitions 0/228 dead transitions.
[2024-06-20 20:01:28,567 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 228 transitions, 3253 flow
[2024-06-20 20:01:28,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:01:28,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:01:28,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-20 20:01:28,568 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-20 20:01:28,568 INFO  L175             Difference]: Start difference. First operand has 153 places, 209 transitions, 2645 flow. Second operand 6 states and 97 transitions.
[2024-06-20 20:01:28,569 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 228 transitions, 3253 flow
[2024-06-20 20:01:28,709 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 228 transitions, 3074 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:28,712 INFO  L231             Difference]: Finished difference. Result has 152 places, 212 transitions, 2560 flow
[2024-06-20 20:01:28,712 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2468, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2560, PETRI_PLACES=152, PETRI_TRANSITIONS=212}
[2024-06-20 20:01:28,712 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 111 predicate places.
[2024-06-20 20:01:28,713 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 212 transitions, 2560 flow
[2024-06-20 20:01:28,713 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:28,713 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:28,713 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:28,713 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 20:01:28,713 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:28,714 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:28,714 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141783145, now seen corresponding path program 1 times
[2024-06-20 20:01:28,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:28,714 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234578224]
[2024-06-20 20:01:28,714 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:28,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:28,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:34,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:34,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:34,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234578224]
[2024-06-20 20:01:34,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234578224] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:34,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:34,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:01:34,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168268134]
[2024-06-20 20:01:34,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:34,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:01:34,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:34,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:01:34,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:01:34,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:34,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 212 transitions, 2560 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:34,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:34,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:34,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:35,397 INFO  L124   PetriNetUnfolderBase]: 2598/3825 cut-off events.
[2024-06-20 20:01:35,397 INFO  L125   PetriNetUnfolderBase]: For 160014/160020 co-relation queries the response was YES.
[2024-06-20 20:01:35,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30307 conditions, 3825 events. 2598/3825 cut-off events. For 160014/160020 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18178 event pairs, 615 based on Foata normal form. 9/3833 useless extension candidates. Maximal degree in co-relation 30232. Up to 3671 conditions per place. 
[2024-06-20 20:01:35,427 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 198 selfloop transitions, 38 changer transitions 0/239 dead transitions.
[2024-06-20 20:01:35,428 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 239 transitions, 3249 flow
[2024-06-20 20:01:35,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:01:35,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:01:35,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-20 20:01:35,429 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.409375
[2024-06-20 20:01:35,429 INFO  L175             Difference]: Start difference. First operand has 152 places, 212 transitions, 2560 flow. Second operand 8 states and 131 transitions.
[2024-06-20 20:01:35,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 239 transitions, 3249 flow
[2024-06-20 20:01:35,558 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 239 transitions, 3106 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 20:01:35,561 INFO  L231             Difference]: Finished difference. Result has 154 places, 216 transitions, 2608 flow
[2024-06-20 20:01:35,561 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2417, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2608, PETRI_PLACES=154, PETRI_TRANSITIONS=216}
[2024-06-20 20:01:35,562 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places.
[2024-06-20 20:01:35,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 216 transitions, 2608 flow
[2024-06-20 20:01:35,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:35,562 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:35,562 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:35,562 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 20:01:35,562 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:35,563 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:35,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 1771641553, now seen corresponding path program 2 times
[2024-06-20 20:01:35,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:35,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942596535]
[2024-06-20 20:01:35,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:35,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:35,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:41,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-20 20:01:41,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:41,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942596535]
[2024-06-20 20:01:41,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942596535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:41,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:41,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:01:41,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985900909]
[2024-06-20 20:01:41,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:41,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:01:41,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:41,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:01:41,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:01:41,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:41,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 216 transitions, 2608 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:41,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:41,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:41,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:42,436 INFO  L124   PetriNetUnfolderBase]: 2626/3868 cut-off events.
[2024-06-20 20:01:42,437 INFO  L125   PetriNetUnfolderBase]: For 169241/169241 co-relation queries the response was YES.
[2024-06-20 20:01:42,454 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31023 conditions, 3868 events. 2626/3868 cut-off events. For 169241/169241 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18438 event pairs, 617 based on Foata normal form. 6/3873 useless extension candidates. Maximal degree in co-relation 30948. Up to 3769 conditions per place. 
[2024-06-20 20:01:42,468 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 218 selfloop transitions, 26 changer transitions 0/247 dead transitions.
[2024-06-20 20:01:42,468 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 247 transitions, 3316 flow
[2024-06-20 20:01:42,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:42,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:42,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions.
[2024-06-20 20:01:42,470 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3775
[2024-06-20 20:01:42,470 INFO  L175             Difference]: Start difference. First operand has 154 places, 216 transitions, 2608 flow. Second operand 10 states and 151 transitions.
[2024-06-20 20:01:42,470 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 247 transitions, 3316 flow
[2024-06-20 20:01:42,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 247 transitions, 3190 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-20 20:01:42,606 INFO  L231             Difference]: Finished difference. Result has 158 places, 219 transitions, 2632 flow
[2024-06-20 20:01:42,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2632, PETRI_PLACES=158, PETRI_TRANSITIONS=219}
[2024-06-20 20:01:42,606 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 117 predicate places.
[2024-06-20 20:01:42,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 219 transitions, 2632 flow
[2024-06-20 20:01:42,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:42,607 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:42,607 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:42,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 20:01:42,607 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:42,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:42,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -1375023473, now seen corresponding path program 7 times
[2024-06-20 20:01:42,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:42,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657459388]
[2024-06-20 20:01:42,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:42,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:42,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:48,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:48,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:48,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657459388]
[2024-06-20 20:01:48,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657459388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:48,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:48,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:01:48,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073403858]
[2024-06-20 20:01:48,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:48,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:01:48,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:48,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:01:48,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:01:48,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:48,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 219 transitions, 2632 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:48,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:48,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:48,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:49,582 INFO  L124   PetriNetUnfolderBase]: 2630/3875 cut-off events.
[2024-06-20 20:01:49,582 INFO  L125   PetriNetUnfolderBase]: For 176076/176082 co-relation queries the response was YES.
[2024-06-20 20:01:49,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31280 conditions, 3875 events. 2630/3875 cut-off events. For 176076/176082 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18481 event pairs, 614 based on Foata normal form. 12/3886 useless extension candidates. Maximal degree in co-relation 31204. Up to 3733 conditions per place. 
[2024-06-20 20:01:49,616 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 219 selfloop transitions, 29 changer transitions 0/251 dead transitions.
[2024-06-20 20:01:49,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 251 transitions, 3374 flow
[2024-06-20 20:01:49,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:01:49,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:01:49,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-20 20:01:49,622 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4027777777777778
[2024-06-20 20:01:49,622 INFO  L175             Difference]: Start difference. First operand has 158 places, 219 transitions, 2632 flow. Second operand 9 states and 145 transitions.
[2024-06-20 20:01:49,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 251 transitions, 3374 flow
[2024-06-20 20:01:49,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 251 transitions, 3248 flow, removed 39 selfloop flow, removed 8 redundant places.
[2024-06-20 20:01:49,759 INFO  L231             Difference]: Finished difference. Result has 159 places, 223 transitions, 2685 flow
[2024-06-20 20:01:49,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2506, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2685, PETRI_PLACES=159, PETRI_TRANSITIONS=223}
[2024-06-20 20:01:49,760 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 118 predicate places.
[2024-06-20 20:01:49,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 223 transitions, 2685 flow
[2024-06-20 20:01:49,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:49,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:49,762 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:49,762 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 20:01:49,763 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:49,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:49,763 INFO  L85        PathProgramCache]: Analyzing trace with hash 1143875565, now seen corresponding path program 3 times
[2024-06-20 20:01:49,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:49,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990942361]
[2024-06-20 20:01:49,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:49,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:49,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:55,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:55,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:55,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990942361]
[2024-06-20 20:01:55,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990942361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:55,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:55,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:01:55,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112304817]
[2024-06-20 20:01:55,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:55,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:01:55,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:55,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:01:55,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:01:55,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:55,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 223 transitions, 2685 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:55,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:55,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:55,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:56,788 INFO  L124   PetriNetUnfolderBase]: 2658/3918 cut-off events.
[2024-06-20 20:01:56,788 INFO  L125   PetriNetUnfolderBase]: For 186070/186070 co-relation queries the response was YES.
[2024-06-20 20:01:56,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31799 conditions, 3918 events. 2658/3918 cut-off events. For 186070/186070 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18708 event pairs, 616 based on Foata normal form. 6/3923 useless extension candidates. Maximal degree in co-relation 31722. Up to 3760 conditions per place. 
[2024-06-20 20:01:56,823 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 213 selfloop transitions, 38 changer transitions 0/254 dead transitions.
[2024-06-20 20:01:56,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 254 transitions, 3419 flow
[2024-06-20 20:01:56,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:56,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:56,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions.
[2024-06-20 20:01:56,824 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3825
[2024-06-20 20:01:56,825 INFO  L175             Difference]: Start difference. First operand has 159 places, 223 transitions, 2685 flow. Second operand 10 states and 153 transitions.
[2024-06-20 20:01:56,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 254 transitions, 3419 flow
[2024-06-20 20:01:56,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 254 transitions, 3288 flow, removed 39 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:56,981 INFO  L231             Difference]: Finished difference. Result has 162 places, 226 transitions, 2740 flow
[2024-06-20 20:01:56,981 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2554, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2740, PETRI_PLACES=162, PETRI_TRANSITIONS=226}
[2024-06-20 20:01:56,981 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places.
[2024-06-20 20:01:56,982 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 226 transitions, 2740 flow
[2024-06-20 20:01:56,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:56,982 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:56,982 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:56,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 20:01:56,982 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:56,983 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:56,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -1366445649, now seen corresponding path program 4 times
[2024-06-20 20:01:56,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:56,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262094736]
[2024-06-20 20:01:56,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:56,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:57,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:02,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:02,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:02,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262094736]
[2024-06-20 20:02:02,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262094736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:02,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:02,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:02:02,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472605220]
[2024-06-20 20:02:02,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:02,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:02:02,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:02,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:02:02,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:02:02,916 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:02,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 226 transitions, 2740 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:02,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:02,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:02,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:04,240 INFO  L124   PetriNetUnfolderBase]: 2686/3962 cut-off events.
[2024-06-20 20:02:04,240 INFO  L125   PetriNetUnfolderBase]: For 196119/196119 co-relation queries the response was YES.
[2024-06-20 20:02:04,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32488 conditions, 3962 events. 2686/3962 cut-off events. For 196119/196119 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19028 event pairs, 612 based on Foata normal form. 6/3967 useless extension candidates. Maximal degree in co-relation 32410. Up to 3835 conditions per place. 
[2024-06-20 20:02:04,274 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 224 selfloop transitions, 30 changer transitions 0/257 dead transitions.
[2024-06-20 20:02:04,274 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 257 transitions, 3486 flow
[2024-06-20 20:02:04,275 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:04,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:04,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions.
[2024-06-20 20:02:04,275 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38
[2024-06-20 20:02:04,276 INFO  L175             Difference]: Start difference. First operand has 162 places, 226 transitions, 2740 flow. Second operand 10 states and 152 transitions.
[2024-06-20 20:02:04,276 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 257 transitions, 3486 flow
[2024-06-20 20:02:04,439 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 257 transitions, 3320 flow, removed 49 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:04,443 INFO  L231             Difference]: Finished difference. Result has 164 places, 229 transitions, 2748 flow
[2024-06-20 20:02:04,443 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2748, PETRI_PLACES=164, PETRI_TRANSITIONS=229}
[2024-06-20 20:02:04,443 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places.
[2024-06-20 20:02:04,444 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 229 transitions, 2748 flow
[2024-06-20 20:02:04,444 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:04,444 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:04,444 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:04,444 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 20:02:04,444 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:04,445 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:04,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1427209081, now seen corresponding path program 5 times
[2024-06-20 20:02:04,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:04,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046192718]
[2024-06-20 20:02:04,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:04,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:04,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:10,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:10,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:10,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046192718]
[2024-06-20 20:02:10,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046192718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:10,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:10,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:02:10,665 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697198185]
[2024-06-20 20:02:10,665 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:10,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:02:10,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:10,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:02:10,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:02:10,824 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:10,825 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 229 transitions, 2748 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:10,825 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:10,825 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:10,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:12,029 INFO  L124   PetriNetUnfolderBase]: 2689/3967 cut-off events.
[2024-06-20 20:02:12,029 INFO  L125   PetriNetUnfolderBase]: For 191909/191909 co-relation queries the response was YES.
[2024-06-20 20:02:12,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32086 conditions, 3967 events. 2689/3967 cut-off events. For 191909/191909 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19039 event pairs, 618 based on Foata normal form. 6/3972 useless extension candidates. Maximal degree in co-relation 32007. Up to 3808 conditions per place. 
[2024-06-20 20:02:12,067 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 229 selfloop transitions, 33 changer transitions 0/265 dead transitions.
[2024-06-20 20:02:12,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 265 transitions, 3598 flow
[2024-06-20 20:02:12,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:12,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:12,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions.
[2024-06-20 20:02:12,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.395
[2024-06-20 20:02:12,069 INFO  L175             Difference]: Start difference. First operand has 164 places, 229 transitions, 2748 flow. Second operand 10 states and 158 transitions.
[2024-06-20 20:02:12,069 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 265 transitions, 3598 flow
[2024-06-20 20:02:12,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 265 transitions, 3456 flow, removed 43 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:12,246 INFO  L231             Difference]: Finished difference. Result has 166 places, 232 transitions, 2784 flow
[2024-06-20 20:02:12,246 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2606, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2784, PETRI_PLACES=166, PETRI_TRANSITIONS=232}
[2024-06-20 20:02:12,246 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places.
[2024-06-20 20:02:12,247 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 232 transitions, 2784 flow
[2024-06-20 20:02:12,247 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:12,247 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:12,247 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:12,247 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 20:02:12,247 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:12,248 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:12,248 INFO  L85        PathProgramCache]: Analyzing trace with hash -1060020184, now seen corresponding path program 2 times
[2024-06-20 20:02:12,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:12,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737670874]
[2024-06-20 20:02:12,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:12,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:12,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:18,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:18,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:18,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737670874]
[2024-06-20 20:02:18,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737670874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:18,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:18,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:02:18,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472093012]
[2024-06-20 20:02:18,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:18,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:02:18,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:18,298 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:02:18,298 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:02:18,375 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:18,375 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 232 transitions, 2784 flow. Second operand  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:18,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:18,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:18,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:19,350 INFO  L124   PetriNetUnfolderBase]: 2686/3963 cut-off events.
[2024-06-20 20:02:19,350 INFO  L125   PetriNetUnfolderBase]: For 195764/195764 co-relation queries the response was YES.
[2024-06-20 20:02:19,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32228 conditions, 3963 events. 2686/3963 cut-off events. For 195764/195764 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18990 event pairs, 636 based on Foata normal form. 1/3963 useless extension candidates. Maximal degree in co-relation 32148. Up to 3945 conditions per place. 
[2024-06-20 20:02:19,451 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 227 selfloop transitions, 11 changer transitions 0/241 dead transitions.
[2024-06-20 20:02:19,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 241 transitions, 3282 flow
[2024-06-20 20:02:19,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:02:19,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:02:19,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions.
[2024-06-20 20:02:19,455 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36666666666666664
[2024-06-20 20:02:19,455 INFO  L175             Difference]: Start difference. First operand has 166 places, 232 transitions, 2784 flow. Second operand 6 states and 88 transitions.
[2024-06-20 20:02:19,455 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 241 transitions, 3282 flow
[2024-06-20 20:02:19,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 241 transitions, 3118 flow, removed 51 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:19,630 INFO  L231             Difference]: Finished difference. Result has 164 places, 232 transitions, 2648 flow
[2024-06-20 20:02:19,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2648, PETRI_PLACES=164, PETRI_TRANSITIONS=232}
[2024-06-20 20:02:19,631 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places.
[2024-06-20 20:02:19,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 232 transitions, 2648 flow
[2024-06-20 20:02:19,631 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:19,631 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:19,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:19,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 20:02:19,632 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:19,633 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:19,633 INFO  L85        PathProgramCache]: Analyzing trace with hash -662268592, now seen corresponding path program 1 times
[2024-06-20 20:02:19,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:19,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568036244]
[2024-06-20 20:02:19,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:19,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:19,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:27,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:27,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:27,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568036244]
[2024-06-20 20:02:27,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568036244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:27,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:27,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:27,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186372135]
[2024-06-20 20:02:27,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:27,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:27,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:27,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:27,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:27,988 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:27,989 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 232 transitions, 2648 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:27,989 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:27,989 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:27,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:29,034 INFO  L124   PetriNetUnfolderBase]: 2685/3962 cut-off events.
[2024-06-20 20:02:29,034 INFO  L125   PetriNetUnfolderBase]: For 199454/199454 co-relation queries the response was YES.
[2024-06-20 20:02:29,055 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31915 conditions, 3962 events. 2685/3962 cut-off events. For 199454/199454 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18999 event pairs, 633 based on Foata normal form. 3/3964 useless extension candidates. Maximal degree in co-relation 31834. Up to 3895 conditions per place. 
[2024-06-20 20:02:29,072 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 224 selfloop transitions, 26 changer transitions 0/253 dead transitions.
[2024-06-20 20:02:29,073 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 253 transitions, 3311 flow
[2024-06-20 20:02:29,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:02:29,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:02:29,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-20 20:02:29,074 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38125
[2024-06-20 20:02:29,074 INFO  L175             Difference]: Start difference. First operand has 164 places, 232 transitions, 2648 flow. Second operand 8 states and 122 transitions.
[2024-06-20 20:02:29,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 253 transitions, 3311 flow
[2024-06-20 20:02:29,254 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 253 transitions, 3279 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 20:02:29,257 INFO  L231             Difference]: Finished difference. Result has 167 places, 235 transitions, 2724 flow
[2024-06-20 20:02:29,258 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2724, PETRI_PLACES=167, PETRI_TRANSITIONS=235}
[2024-06-20 20:02:29,267 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places.
[2024-06-20 20:02:29,268 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 235 transitions, 2724 flow
[2024-06-20 20:02:29,268 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:29,268 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:29,268 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:29,268 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 20:02:29,268 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:29,268 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:29,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 1877377194, now seen corresponding path program 2 times
[2024-06-20 20:02:29,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:29,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298606551]
[2024-06-20 20:02:29,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:29,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:29,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:37,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:37,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:37,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298606551]
[2024-06-20 20:02:37,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298606551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:37,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:37,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:37,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640402771]
[2024-06-20 20:02:37,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:37,515 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:37,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:37,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:37,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:37,606 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:37,607 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 235 transitions, 2724 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:37,607 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:37,607 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:37,607 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:38,646 INFO  L124   PetriNetUnfolderBase]: 2650/3909 cut-off events.
[2024-06-20 20:02:38,647 INFO  L125   PetriNetUnfolderBase]: For 205686/205692 co-relation queries the response was YES.
[2024-06-20 20:02:38,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 3909 events. 2650/3909 cut-off events. For 205686/205692 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18722 event pairs, 634 based on Foata normal form. 7/3915 useless extension candidates. Maximal degree in co-relation 31739. Up to 3844 conditions per place. 
[2024-06-20 20:02:38,683 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 219 selfloop transitions, 26 changer transitions 0/248 dead transitions.
[2024-06-20 20:02:38,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 248 transitions, 3246 flow
[2024-06-20 20:02:38,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:02:38,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:02:38,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-20 20:02:38,684 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38571428571428573
[2024-06-20 20:02:38,684 INFO  L175             Difference]: Start difference. First operand has 167 places, 235 transitions, 2724 flow. Second operand 7 states and 108 transitions.
[2024-06-20 20:02:38,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 248 transitions, 3246 flow
[2024-06-20 20:02:38,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 248 transitions, 3188 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-20 20:02:38,845 INFO  L231             Difference]: Finished difference. Result has 168 places, 235 transitions, 2724 flow
[2024-06-20 20:02:38,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2666, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2724, PETRI_PLACES=168, PETRI_TRANSITIONS=235}
[2024-06-20 20:02:38,846 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places.
[2024-06-20 20:02:38,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 235 transitions, 2724 flow
[2024-06-20 20:02:38,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:38,846 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:38,846 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:38,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 20:02:38,846 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:38,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:38,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282044363, now seen corresponding path program 1 times
[2024-06-20 20:02:38,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:38,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331053881]
[2024-06-20 20:02:38,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:38,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:38,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:45,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:45,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:45,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331053881]
[2024-06-20 20:02:45,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331053881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:45,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:45,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:02:45,186 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868235002]
[2024-06-20 20:02:45,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:45,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:02:45,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:45,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:02:45,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:02:45,296 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:45,297 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 235 transitions, 2724 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:45,297 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:45,297 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:45,297 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:46,836 INFO  L124   PetriNetUnfolderBase]: 2988/4447 cut-off events.
[2024-06-20 20:02:46,836 INFO  L125   PetriNetUnfolderBase]: For 270547/270553 co-relation queries the response was YES.
[2024-06-20 20:02:46,858 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37633 conditions, 4447 events. 2988/4447 cut-off events. For 270547/270553 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22356 event pairs, 422 based on Foata normal form. 30/4476 useless extension candidates. Maximal degree in co-relation 37550. Up to 2548 conditions per place. 
[2024-06-20 20:02:46,876 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 212 selfloop transitions, 89 changer transitions 0/304 dead transitions.
[2024-06-20 20:02:46,876 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 304 transitions, 4224 flow
[2024-06-20 20:02:46,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:46,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:46,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 20:02:46,877 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-20 20:02:46,877 INFO  L175             Difference]: Start difference. First operand has 168 places, 235 transitions, 2724 flow. Second operand 10 states and 190 transitions.
[2024-06-20 20:02:46,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 304 transitions, 4224 flow
[2024-06-20 20:02:47,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 304 transitions, 4162 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-20 20:02:47,070 INFO  L231             Difference]: Finished difference. Result has 174 places, 241 transitions, 3076 flow
[2024-06-20 20:02:47,071 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2662, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3076, PETRI_PLACES=174, PETRI_TRANSITIONS=241}
[2024-06-20 20:02:47,071 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places.
[2024-06-20 20:02:47,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 241 transitions, 3076 flow
[2024-06-20 20:02:47,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:47,072 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:47,073 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:47,073 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 20:02:47,073 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:47,073 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:47,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -1280170413, now seen corresponding path program 2 times
[2024-06-20 20:02:47,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:47,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231289113]
[2024-06-20 20:02:47,074 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:47,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:47,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:53,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:53,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:53,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231289113]
[2024-06-20 20:02:53,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231289113] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:53,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:53,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:02:53,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419192596]
[2024-06-20 20:02:53,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:53,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:02:53,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:53,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:02:53,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:02:53,723 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:53,723 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 241 transitions, 3076 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:53,723 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:53,723 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:53,724 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:55,365 INFO  L124   PetriNetUnfolderBase]: 3293/4934 cut-off events.
[2024-06-20 20:02:55,366 INFO  L125   PetriNetUnfolderBase]: For 328700/328706 co-relation queries the response was YES.
[2024-06-20 20:02:55,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44252 conditions, 4934 events. 3293/4934 cut-off events. For 328700/328706 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25762 event pairs, 701 based on Foata normal form. 30/4963 useless extension candidates. Maximal degree in co-relation 44166. Up to 3496 conditions per place. 
[2024-06-20 20:02:55,410 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 210 selfloop transitions, 97 changer transitions 0/310 dead transitions.
[2024-06-20 20:02:55,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 310 transitions, 4620 flow
[2024-06-20 20:02:55,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:02:55,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:02:55,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions.
[2024-06-20 20:02:55,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47045454545454546
[2024-06-20 20:02:55,412 INFO  L175             Difference]: Start difference. First operand has 174 places, 241 transitions, 3076 flow. Second operand 11 states and 207 transitions.
[2024-06-20 20:02:55,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 310 transitions, 4620 flow
[2024-06-20 20:02:55,695 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 310 transitions, 4432 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-20 20:02:55,699 INFO  L231             Difference]: Finished difference. Result has 181 places, 246 transitions, 3283 flow
[2024-06-20 20:02:55,699 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2888, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3283, PETRI_PLACES=181, PETRI_TRANSITIONS=246}
[2024-06-20 20:02:55,699 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places.
[2024-06-20 20:02:55,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 246 transitions, 3283 flow
[2024-06-20 20:02:55,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:55,700 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:55,700 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:55,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 20:02:55,700 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:55,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:55,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -1280166693, now seen corresponding path program 3 times
[2024-06-20 20:02:55,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:55,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030885448]
[2024-06-20 20:02:55,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:55,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:55,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:01,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:01,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:01,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030885448]
[2024-06-20 20:03:01,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030885448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:01,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:01,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:03:01,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640268585]
[2024-06-20 20:03:01,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:01,860 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:03:01,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:01,860 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:03:01,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:03:02,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:02,017 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 246 transitions, 3283 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:02,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:02,017 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:02,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:03,830 INFO  L124   PetriNetUnfolderBase]: 3649/5520 cut-off events.
[2024-06-20 20:03:03,830 INFO  L125   PetriNetUnfolderBase]: For 401674/401680 co-relation queries the response was YES.
[2024-06-20 20:03:03,865 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48229 conditions, 5520 events. 3649/5520 cut-off events. For 401674/401680 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29440 event pairs, 825 based on Foata normal form. 84/5603 useless extension candidates. Maximal degree in co-relation 48140. Up to 3586 conditions per place. 
[2024-06-20 20:03:03,888 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 207 selfloop transitions, 108 changer transitions 0/318 dead transitions.
[2024-06-20 20:03:03,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 318 transitions, 4819 flow
[2024-06-20 20:03:03,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:03:03,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:03:03,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-20 20:03:03,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4975
[2024-06-20 20:03:03,890 INFO  L175             Difference]: Start difference. First operand has 181 places, 246 transitions, 3283 flow. Second operand 10 states and 199 transitions.
[2024-06-20 20:03:03,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 318 transitions, 4819 flow
[2024-06-20 20:03:04,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 318 transitions, 4654 flow, removed 47 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:04,277 INFO  L231             Difference]: Finished difference. Result has 188 places, 254 transitions, 3560 flow
[2024-06-20 20:03:04,277 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3560, PETRI_PLACES=188, PETRI_TRANSITIONS=254}
[2024-06-20 20:03:04,278 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places.
[2024-06-20 20:03:04,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 254 transitions, 3560 flow
[2024-06-20 20:03:04,278 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:04,278 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:04,278 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:04,278 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 20:03:04,278 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:04,279 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:04,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1756941585, now seen corresponding path program 4 times
[2024-06-20 20:03:04,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:04,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227080107]
[2024-06-20 20:03:04,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:04,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:04,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:10,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:10,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:10,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227080107]
[2024-06-20 20:03:10,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227080107] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:10,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:10,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:03:10,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707913907]
[2024-06-20 20:03:10,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:10,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:03:10,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:10,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:03:10,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:03:11,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:11,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 254 transitions, 3560 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:11,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:11,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:11,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:12,797 INFO  L124   PetriNetUnfolderBase]: 3773/5724 cut-off events.
[2024-06-20 20:03:12,798 INFO  L125   PetriNetUnfolderBase]: For 400386/400392 co-relation queries the response was YES.
[2024-06-20 20:03:12,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51861 conditions, 5724 events. 3773/5724 cut-off events. For 400386/400392 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 31140 event pairs, 960 based on Foata normal form. 36/5759 useless extension candidates. Maximal degree in co-relation 51768. Up to 4999 conditions per place. 
[2024-06-20 20:03:12,859 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 233 selfloop transitions, 65 changer transitions 0/301 dead transitions.
[2024-06-20 20:03:12,859 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 301 transitions, 4572 flow
[2024-06-20 20:03:12,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:03:12,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:03:12,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-20 20:03:12,861 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 20:03:12,861 INFO  L175             Difference]: Start difference. First operand has 188 places, 254 transitions, 3560 flow. Second operand 10 states and 180 transitions.
[2024-06-20 20:03:12,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 301 transitions, 4572 flow
[2024-06-20 20:03:13,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 4270 flow, removed 58 selfloop flow, removed 6 redundant places.
[2024-06-20 20:03:13,408 INFO  L231             Difference]: Finished difference. Result has 192 places, 256 transitions, 3498 flow
[2024-06-20 20:03:13,408 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3258, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3498, PETRI_PLACES=192, PETRI_TRANSITIONS=256}
[2024-06-20 20:03:13,410 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places.
[2024-06-20 20:03:13,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 256 transitions, 3498 flow
[2024-06-20 20:03:13,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:13,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:13,410 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:13,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 20:03:13,410 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:13,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:13,411 INFO  L85        PathProgramCache]: Analyzing trace with hash -1757085735, now seen corresponding path program 5 times
[2024-06-20 20:03:13,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:13,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815098712]
[2024-06-20 20:03:13,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:13,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:13,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:19,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:19,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:19,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815098712]
[2024-06-20 20:03:19,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815098712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:19,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:19,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:03:19,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30813210]
[2024-06-20 20:03:19,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:19,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:03:19,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:19,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:03:19,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:03:19,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:19,556 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 256 transitions, 3498 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:19,556 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:19,556 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:19,557 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:21,419 INFO  L124   PetriNetUnfolderBase]: 3974/6067 cut-off events.
[2024-06-20 20:03:21,420 INFO  L125   PetriNetUnfolderBase]: For 435954/435960 co-relation queries the response was YES.
[2024-06-20 20:03:21,454 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51749 conditions, 6067 events. 3974/6067 cut-off events. For 435954/435960 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 33391 event pairs, 950 based on Foata normal form. 80/6146 useless extension candidates. Maximal degree in co-relation 51655. Up to 4514 conditions per place. 
[2024-06-20 20:03:21,476 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 235 selfloop transitions, 80 changer transitions 0/318 dead transitions.
[2024-06-20 20:03:21,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 318 transitions, 4876 flow
[2024-06-20 20:03:21,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:03:21,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:03:21,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-20 20:03:21,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.485
[2024-06-20 20:03:21,477 INFO  L175             Difference]: Start difference. First operand has 192 places, 256 transitions, 3498 flow. Second operand 10 states and 194 transitions.
[2024-06-20 20:03:21,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 318 transitions, 4876 flow
[2024-06-20 20:03:21,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 318 transitions, 4688 flow, removed 33 selfloop flow, removed 8 redundant places.
[2024-06-20 20:03:21,862 INFO  L231             Difference]: Finished difference. Result has 194 places, 258 transitions, 3583 flow
[2024-06-20 20:03:21,862 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3310, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3583, PETRI_PLACES=194, PETRI_TRANSITIONS=258}
[2024-06-20 20:03:21,863 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places.
[2024-06-20 20:03:21,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 258 transitions, 3583 flow
[2024-06-20 20:03:21,863 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:21,863 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:21,863 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:21,863 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 20:03:21,863 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:21,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:21,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 2009373434, now seen corresponding path program 1 times
[2024-06-20 20:03:21,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:21,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023335627]
[2024-06-20 20:03:21,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:21,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:21,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:28,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:28,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:28,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023335627]
[2024-06-20 20:03:28,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023335627] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:28,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:28,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:03:28,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153089688]
[2024-06-20 20:03:28,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:28,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:03:28,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:28,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:03:28,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:03:28,756 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:28,756 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 258 transitions, 3583 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:28,756 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:28,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:28,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:30,392 INFO  L124   PetriNetUnfolderBase]: 3994/6095 cut-off events.
[2024-06-20 20:03:30,393 INFO  L125   PetriNetUnfolderBase]: For 373245/373251 co-relation queries the response was YES.
[2024-06-20 20:03:30,436 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51999 conditions, 6095 events. 3994/6095 cut-off events. For 373245/373251 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 33699 event pairs, 1098 based on Foata normal form. 10/6104 useless extension candidates. Maximal degree in co-relation 51904. Up to 5640 conditions per place. 
[2024-06-20 20:03:30,462 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 225 selfloop transitions, 66 changer transitions 0/294 dead transitions.
[2024-06-20 20:03:30,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 294 transitions, 4530 flow
[2024-06-20 20:03:30,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:03:30,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:03:30,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 20:03:30,464 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.446875
[2024-06-20 20:03:30,464 INFO  L175             Difference]: Start difference. First operand has 194 places, 258 transitions, 3583 flow. Second operand 8 states and 143 transitions.
[2024-06-20 20:03:30,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 294 transitions, 4530 flow
[2024-06-20 20:03:31,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 294 transitions, 4297 flow, removed 37 selfloop flow, removed 8 redundant places.
[2024-06-20 20:03:31,050 INFO  L231             Difference]: Finished difference. Result has 194 places, 263 transitions, 3594 flow
[2024-06-20 20:03:31,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3356, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3594, PETRI_PLACES=194, PETRI_TRANSITIONS=263}
[2024-06-20 20:03:31,051 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places.
[2024-06-20 20:03:31,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 263 transitions, 3594 flow
[2024-06-20 20:03:31,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:31,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:31,051 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:31,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 20:03:31,052 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:31,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:31,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1914419629, now seen corresponding path program 6 times
[2024-06-20 20:03:31,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:31,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788658742]
[2024-06-20 20:03:31,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:31,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:31,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:37,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:37,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:37,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788658742]
[2024-06-20 20:03:37,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788658742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:37,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:37,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:03:37,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304286140]
[2024-06-20 20:03:37,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:37,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:03:37,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:37,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:03:37,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:03:37,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:37,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 263 transitions, 3594 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:37,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:37,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:37,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:39,509 INFO  L124   PetriNetUnfolderBase]: 4222/6467 cut-off events.
[2024-06-20 20:03:39,509 INFO  L125   PetriNetUnfolderBase]: For 427895/427901 co-relation queries the response was YES.
[2024-06-20 20:03:39,551 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55447 conditions, 6467 events. 4222/6467 cut-off events. For 427895/427901 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 36451 event pairs, 1013 based on Foata normal form. 30/6496 useless extension candidates. Maximal degree in co-relation 55351. Up to 5162 conditions per place. 
[2024-06-20 20:03:39,577 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 238 selfloop transitions, 86 changer transitions 0/327 dead transitions.
[2024-06-20 20:03:39,578 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 327 transitions, 5132 flow
[2024-06-20 20:03:39,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:03:39,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:03:39,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-20 20:03:39,579 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48
[2024-06-20 20:03:39,579 INFO  L175             Difference]: Start difference. First operand has 194 places, 263 transitions, 3594 flow. Second operand 10 states and 192 transitions.
[2024-06-20 20:03:39,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 327 transitions, 5132 flow
[2024-06-20 20:03:40,134 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 327 transitions, 5013 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:40,138 INFO  L231             Difference]: Finished difference. Result has 200 places, 267 transitions, 3837 flow
[2024-06-20 20:03:40,138 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3475, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3837, PETRI_PLACES=200, PETRI_TRANSITIONS=267}
[2024-06-20 20:03:40,138 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places.
[2024-06-20 20:03:40,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 267 transitions, 3837 flow
[2024-06-20 20:03:40,139 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:40,139 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:40,139 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:40,139 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 20:03:40,139 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:40,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:40,139 INFO  L85        PathProgramCache]: Analyzing trace with hash 1816940535, now seen corresponding path program 7 times
[2024-06-20 20:03:40,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:40,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779118836]
[2024-06-20 20:03:40,140 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:40,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:40,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:46,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:46,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:46,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779118836]
[2024-06-20 20:03:46,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779118836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:46,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:46,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:03:46,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815834199]
[2024-06-20 20:03:46,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:46,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:03:46,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:46,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:03:46,535 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:03:46,644 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:46,644 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 267 transitions, 3837 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:46,644 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:46,644 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:46,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:48,827 INFO  L124   PetriNetUnfolderBase]: 4534/6991 cut-off events.
[2024-06-20 20:03:48,827 INFO  L125   PetriNetUnfolderBase]: For 521300/521306 co-relation queries the response was YES.
[2024-06-20 20:03:48,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59535 conditions, 6991 events. 4534/6991 cut-off events. For 521300/521306 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 40266 event pairs, 1150 based on Foata normal form. 80/7070 useless extension candidates. Maximal degree in co-relation 59437. Up to 5283 conditions per place. 
[2024-06-20 20:03:48,900 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 237 selfloop transitions, 98 changer transitions 0/338 dead transitions.
[2024-06-20 20:03:48,900 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 338 transitions, 5483 flow
[2024-06-20 20:03:48,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:03:48,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:03:48,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-20 20:03:48,908 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.505
[2024-06-20 20:03:48,908 INFO  L175             Difference]: Start difference. First operand has 200 places, 267 transitions, 3837 flow. Second operand 10 states and 202 transitions.
[2024-06-20 20:03:48,908 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 338 transitions, 5483 flow
[2024-06-20 20:03:49,564 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 338 transitions, 5295 flow, removed 52 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:49,568 INFO  L231             Difference]: Finished difference. Result has 205 places, 269 transitions, 3962 flow
[2024-06-20 20:03:49,568 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3653, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3962, PETRI_PLACES=205, PETRI_TRANSITIONS=269}
[2024-06-20 20:03:49,569 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 164 predicate places.
[2024-06-20 20:03:49,569 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 269 transitions, 3962 flow
[2024-06-20 20:03:49,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:49,569 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:49,569 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:49,569 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 20:03:49,570 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:49,570 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:49,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -1105077597, now seen corresponding path program 1 times
[2024-06-20 20:03:49,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:49,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205182122]
[2024-06-20 20:03:49,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:49,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:49,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:55,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:55,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:55,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205182122]
[2024-06-20 20:03:55,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205182122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:55,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:55,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:03:55,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552653873]
[2024-06-20 20:03:55,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:55,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:03:55,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:55,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:03:55,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:03:55,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:55,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 269 transitions, 3962 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:55,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:55,543 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:55,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:57,537 INFO  L124   PetriNetUnfolderBase]: 4562/7036 cut-off events.
[2024-06-20 20:03:57,537 INFO  L125   PetriNetUnfolderBase]: For 463318/463320 co-relation queries the response was YES.
[2024-06-20 20:03:57,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60287 conditions, 7036 events. 4562/7036 cut-off events. For 463318/463320 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 40744 event pairs, 1347 based on Foata normal form. 8/7043 useless extension candidates. Maximal degree in co-relation 60187. Up to 6554 conditions per place. 
[2024-06-20 20:03:57,604 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 239 selfloop transitions, 65 changer transitions 0/307 dead transitions.
[2024-06-20 20:03:57,604 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 307 transitions, 4970 flow
[2024-06-20 20:03:57,605 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:03:57,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:03:57,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 20:03:57,605 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45625
[2024-06-20 20:03:57,605 INFO  L175             Difference]: Start difference. First operand has 205 places, 269 transitions, 3962 flow. Second operand 8 states and 146 transitions.
[2024-06-20 20:03:57,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 307 transitions, 4970 flow
[2024-06-20 20:03:58,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 307 transitions, 4705 flow, removed 38 selfloop flow, removed 8 redundant places.
[2024-06-20 20:03:58,218 INFO  L231             Difference]: Finished difference. Result has 205 places, 272 transitions, 3953 flow
[2024-06-20 20:03:58,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3697, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3953, PETRI_PLACES=205, PETRI_TRANSITIONS=272}
[2024-06-20 20:03:58,218 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 164 predicate places.
[2024-06-20 20:03:58,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 272 transitions, 3953 flow
[2024-06-20 20:03:58,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:58,219 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:58,219 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:58,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 20:03:58,219 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:58,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:58,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 1817084685, now seen corresponding path program 8 times
[2024-06-20 20:03:58,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:58,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085730583]
[2024-06-20 20:03:58,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:58,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:58,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:04,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:04,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:04,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085730583]
[2024-06-20 20:04:04,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085730583] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:04,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:04,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:04:04,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181391013]
[2024-06-20 20:04:04,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:04,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:04:04,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:04,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:04:04,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:04:05,004 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:05,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 272 transitions, 3953 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:05,005 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:05,005 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:05,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:07,214 INFO  L124   PetriNetUnfolderBase]: 4686/7239 cut-off events.
[2024-06-20 20:04:07,214 INFO  L125   PetriNetUnfolderBase]: For 508851/508857 co-relation queries the response was YES.
[2024-06-20 20:04:07,262 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61538 conditions, 7239 events. 4686/7239 cut-off events. For 508851/508857 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 42275 event pairs, 1358 based on Foata normal form. 36/7274 useless extension candidates. Maximal degree in co-relation 61437. Up to 6530 conditions per place. 
[2024-06-20 20:04:07,290 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 246 selfloop transitions, 73 changer transitions 0/322 dead transitions.
[2024-06-20 20:04:07,290 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 322 transitions, 5051 flow
[2024-06-20 20:04:07,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:04:07,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:04:07,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-20 20:04:07,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4525
[2024-06-20 20:04:07,292 INFO  L175             Difference]: Start difference. First operand has 205 places, 272 transitions, 3953 flow. Second operand 10 states and 181 transitions.
[2024-06-20 20:04:07,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 322 transitions, 5051 flow
[2024-06-20 20:04:07,909 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 322 transitions, 4825 flow, removed 50 selfloop flow, removed 6 redundant places.
[2024-06-20 20:04:07,913 INFO  L231             Difference]: Finished difference. Result has 209 places, 274 transitions, 3994 flow
[2024-06-20 20:04:07,914 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3727, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3994, PETRI_PLACES=209, PETRI_TRANSITIONS=274}
[2024-06-20 20:04:07,914 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places.
[2024-06-20 20:04:07,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 274 transitions, 3994 flow
[2024-06-20 20:04:07,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:07,914 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:07,914 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:07,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 20:04:07,915 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:07,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:07,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822654827, now seen corresponding path program 2 times
[2024-06-20 20:04:07,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:07,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743991138]
[2024-06-20 20:04:07,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:07,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:07,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:13,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:13,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:13,383 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743991138]
[2024-06-20 20:04:13,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743991138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:13,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:13,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:04:13,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613048388]
[2024-06-20 20:04:13,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:13,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:04:13,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:13,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:04:13,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:04:13,499 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:13,499 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 274 transitions, 3994 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:13,499 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:13,499 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:13,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:15,686 INFO  L124   PetriNetUnfolderBase]: 4714/7284 cut-off events.
[2024-06-20 20:04:15,686 INFO  L125   PetriNetUnfolderBase]: For 503063/503065 co-relation queries the response was YES.
[2024-06-20 20:04:15,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62302 conditions, 7284 events. 4714/7284 cut-off events. For 503063/503065 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 42678 event pairs, 1369 based on Foata normal form. 8/7291 useless extension candidates. Maximal degree in co-relation 62200. Up to 6802 conditions per place. 
[2024-06-20 20:04:15,758 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 244 selfloop transitions, 61 changer transitions 0/308 dead transitions.
[2024-06-20 20:04:15,758 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 308 transitions, 4910 flow
[2024-06-20 20:04:15,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:04:15,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:04:15,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-20 20:04:15,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-20 20:04:15,760 INFO  L175             Difference]: Start difference. First operand has 209 places, 274 transitions, 3994 flow. Second operand 8 states and 141 transitions.
[2024-06-20 20:04:15,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 308 transitions, 4910 flow
[2024-06-20 20:04:16,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 308 transitions, 4693 flow, removed 39 selfloop flow, removed 8 redundant places.
[2024-06-20 20:04:16,302 INFO  L231             Difference]: Finished difference. Result has 209 places, 277 transitions, 4035 flow
[2024-06-20 20:04:16,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3777, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4035, PETRI_PLACES=209, PETRI_TRANSITIONS=277}
[2024-06-20 20:04:16,303 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places.
[2024-06-20 20:04:16,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 277 transitions, 4035 flow
[2024-06-20 20:04:16,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:16,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:16,304 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:16,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 20:04:16,304 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:16,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:16,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822447065, now seen corresponding path program 9 times
[2024-06-20 20:04:16,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:16,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323998606]
[2024-06-20 20:04:16,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:16,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:16,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:22,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:22,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:22,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323998606]
[2024-06-20 20:04:22,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323998606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:22,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:22,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:04:22,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963530917]
[2024-06-20 20:04:22,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:22,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:04:22,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:22,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:04:22,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:04:22,803 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:22,803 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 277 transitions, 4035 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:22,804 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:22,804 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:22,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:25,010 INFO  L124   PetriNetUnfolderBase]: 4838/7487 cut-off events.
[2024-06-20 20:04:25,010 INFO  L125   PetriNetUnfolderBase]: For 553264/553270 co-relation queries the response was YES.
[2024-06-20 20:04:25,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63956 conditions, 7487 events. 4838/7487 cut-off events. For 553264/553270 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 44184 event pairs, 1344 based on Foata normal form. 36/7522 useless extension candidates. Maximal degree in co-relation 63853. Up to 6778 conditions per place. 
[2024-06-20 20:04:25,088 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 251 selfloop transitions, 69 changer transitions 0/323 dead transitions.
[2024-06-20 20:04:25,088 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 323 transitions, 5037 flow
[2024-06-20 20:04:25,089 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:04:25,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:04:25,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-20 20:04:25,089 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44
[2024-06-20 20:04:25,090 INFO  L175             Difference]: Start difference. First operand has 209 places, 277 transitions, 4035 flow. Second operand 10 states and 176 transitions.
[2024-06-20 20:04:25,090 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 323 transitions, 5037 flow
[2024-06-20 20:04:25,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 323 transitions, 4809 flow, removed 55 selfloop flow, removed 6 redundant places.
[2024-06-20 20:04:25,644 INFO  L231             Difference]: Finished difference. Result has 213 places, 279 transitions, 4074 flow
[2024-06-20 20:04:25,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4074, PETRI_PLACES=213, PETRI_TRANSITIONS=279}
[2024-06-20 20:04:25,645 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places.
[2024-06-20 20:04:25,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 279 transitions, 4074 flow
[2024-06-20 20:04:25,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:25,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:25,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:25,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 20:04:25,646 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:25,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:25,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822662267, now seen corresponding path program 3 times
[2024-06-20 20:04:25,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:25,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451339759]
[2024-06-20 20:04:25,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:25,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:25,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:31,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:31,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:31,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451339759]
[2024-06-20 20:04:31,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451339759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:31,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:31,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:04:31,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825721995]
[2024-06-20 20:04:31,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:31,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:04:31,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:31,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:04:31,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:04:31,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:31,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 279 transitions, 4074 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:31,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:31,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:31,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:33,704 INFO  L124   PetriNetUnfolderBase]: 4866/7531 cut-off events.
[2024-06-20 20:04:33,704 INFO  L125   PetriNetUnfolderBase]: For 546486/546492 co-relation queries the response was YES.
[2024-06-20 20:04:33,755 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64689 conditions, 7531 events. 4866/7531 cut-off events. For 546486/546492 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 44523 event pairs, 1360 based on Foata normal form. 12/7542 useless extension candidates. Maximal degree in co-relation 64585. Up to 6896 conditions per place. 
[2024-06-20 20:04:33,783 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 239 selfloop transitions, 75 changer transitions 0/317 dead transitions.
[2024-06-20 20:04:33,784 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 317 transitions, 5021 flow
[2024-06-20 20:04:33,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:33,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:33,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 20:04:33,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 20:04:33,785 INFO  L175             Difference]: Start difference. First operand has 213 places, 279 transitions, 4074 flow. Second operand 9 states and 156 transitions.
[2024-06-20 20:04:33,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 317 transitions, 5021 flow
[2024-06-20 20:04:34,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 317 transitions, 4804 flow, removed 43 selfloop flow, removed 8 redundant places.
[2024-06-20 20:04:34,401 INFO  L231             Difference]: Finished difference. Result has 214 places, 282 transitions, 4145 flow
[2024-06-20 20:04:34,402 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3857, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4145, PETRI_PLACES=214, PETRI_TRANSITIONS=282}
[2024-06-20 20:04:34,402 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places.
[2024-06-20 20:04:34,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 282 transitions, 4145 flow
[2024-06-20 20:04:34,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:34,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:34,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:34,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 20:04:34,403 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:34,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:34,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 2009672336, now seen corresponding path program 1 times
[2024-06-20 20:04:34,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:34,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511117995]
[2024-06-20 20:04:34,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:34,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:34,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:41,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-20 20:04:41,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:41,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511117995]
[2024-06-20 20:04:41,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511117995] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:41,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:41,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:04:41,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466707641]
[2024-06-20 20:04:41,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:41,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:04:41,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:41,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:04:41,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:04:41,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:41,230 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 282 transitions, 4145 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:41,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:41,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:41,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:43,114 INFO  L124   PetriNetUnfolderBase]: 4876/7544 cut-off events.
[2024-06-20 20:04:43,115 INFO  L125   PetriNetUnfolderBase]: For 539766/539766 co-relation queries the response was YES.
[2024-06-20 20:04:43,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64502 conditions, 7544 events. 4876/7544 cut-off events. For 539766/539766 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 44607 event pairs, 1541 based on Foata normal form. 2/7545 useless extension candidates. Maximal degree in co-relation 64397. Up to 7483 conditions per place. 
[2024-06-20 20:04:43,200 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 281 selfloop transitions, 23 changer transitions 0/307 dead transitions.
[2024-06-20 20:04:43,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 307 transitions, 4991 flow
[2024-06-20 20:04:43,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:04:43,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:04:43,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 20:04:43,203 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 20:04:43,203 INFO  L175             Difference]: Start difference. First operand has 214 places, 282 transitions, 4145 flow. Second operand 7 states and 113 transitions.
[2024-06-20 20:04:43,203 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 307 transitions, 4991 flow
[2024-06-20 20:04:44,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 307 transitions, 4732 flow, removed 57 selfloop flow, removed 7 redundant places.
[2024-06-20 20:04:44,031 INFO  L231             Difference]: Finished difference. Result has 214 places, 287 transitions, 4024 flow
[2024-06-20 20:04:44,031 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3886, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4024, PETRI_PLACES=214, PETRI_TRANSITIONS=287}
[2024-06-20 20:04:44,032 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places.
[2024-06-20 20:04:44,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 287 transitions, 4024 flow
[2024-06-20 20:04:44,032 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:44,032 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:44,033 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:44,033 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 20:04:44,033 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:44,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:44,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 1487149564, now seen corresponding path program 2 times
[2024-06-20 20:04:44,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:44,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956772175]
[2024-06-20 20:04:44,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:44,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:44,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:50,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:50,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:50,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956772175]
[2024-06-20 20:04:50,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956772175] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:50,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:50,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:04:50,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241572053]
[2024-06-20 20:04:50,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:50,439 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:04:50,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:50,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:04:50,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:04:50,562 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:50,562 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 287 transitions, 4024 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:50,562 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:50,562 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:50,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:52,627 INFO  L124   PetriNetUnfolderBase]: 4942/7638 cut-off events.
[2024-06-20 20:04:52,627 INFO  L125   PetriNetUnfolderBase]: For 565157/565159 co-relation queries the response was YES.
[2024-06-20 20:04:52,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65242 conditions, 7638 events. 4942/7638 cut-off events. For 565157/565159 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 45189 event pairs, 1392 based on Foata normal form. 6/7643 useless extension candidates. Maximal degree in co-relation 65136. Up to 7136 conditions per place. 
[2024-06-20 20:04:52,710 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 248 selfloop transitions, 70 changer transitions 0/321 dead transitions.
[2024-06-20 20:04:52,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 321 transitions, 5177 flow
[2024-06-20 20:04:52,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:04:52,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:04:52,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-20 20:04:52,712 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-20 20:04:52,712 INFO  L175             Difference]: Start difference. First operand has 214 places, 287 transitions, 4024 flow. Second operand 7 states and 122 transitions.
[2024-06-20 20:04:52,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 321 transitions, 5177 flow
[2024-06-20 20:04:53,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 321 transitions, 5123 flow, removed 20 selfloop flow, removed 3 redundant places.
[2024-06-20 20:04:53,415 INFO  L231             Difference]: Finished difference. Result has 219 places, 300 transitions, 4399 flow
[2024-06-20 20:04:53,416 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3970, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4399, PETRI_PLACES=219, PETRI_TRANSITIONS=300}
[2024-06-20 20:04:53,416 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places.
[2024-06-20 20:04:53,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 300 transitions, 4399 flow
[2024-06-20 20:04:53,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:53,416 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:53,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:53,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 20:04:53,417 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:53,417 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:53,417 INFO  L85        PathProgramCache]: Analyzing trace with hash 1410742113, now seen corresponding path program 4 times
[2024-06-20 20:04:53,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:53,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374748277]
[2024-06-20 20:04:53,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:53,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:53,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:59,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:59,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:59,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374748277]
[2024-06-20 20:04:59,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374748277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:59,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:59,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:04:59,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104365574]
[2024-06-20 20:04:59,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:59,213 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:04:59,213 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:59,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:04:59,213 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:04:59,316 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:59,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 300 transitions, 4399 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:59,316 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:59,316 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:59,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:01,503 INFO  L124   PetriNetUnfolderBase]: 4942/7637 cut-off events.
[2024-06-20 20:05:01,503 INFO  L125   PetriNetUnfolderBase]: For 580027/580033 co-relation queries the response was YES.
[2024-06-20 20:05:01,703 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65834 conditions, 7637 events. 4942/7637 cut-off events. For 580027/580033 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 45240 event pairs, 1534 based on Foata normal form. 12/7648 useless extension candidates. Maximal degree in co-relation 65725. Up to 7510 conditions per place. 
[2024-06-20 20:05:01,732 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 296 selfloop transitions, 31 changer transitions 0/330 dead transitions.
[2024-06-20 20:05:01,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 330 transitions, 5259 flow
[2024-06-20 20:05:01,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:05:01,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:05:01,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions.
[2024-06-20 20:05:01,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3972222222222222
[2024-06-20 20:05:01,734 INFO  L175             Difference]: Start difference. First operand has 219 places, 300 transitions, 4399 flow. Second operand 9 states and 143 transitions.
[2024-06-20 20:05:01,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 330 transitions, 5259 flow
[2024-06-20 20:05:02,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 330 transitions, 5121 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-20 20:05:02,386 INFO  L231             Difference]: Finished difference. Result has 224 places, 303 transitions, 4473 flow
[2024-06-20 20:05:02,387 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4473, PETRI_PLACES=224, PETRI_TRANSITIONS=303}
[2024-06-20 20:05:02,387 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places.
[2024-06-20 20:05:02,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 303 transitions, 4473 flow
[2024-06-20 20:05:02,387 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:02,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:02,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:02,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 20:05:02,388 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:02,388 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:02,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 1100404957, now seen corresponding path program 5 times
[2024-06-20 20:05:02,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:02,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020937350]
[2024-06-20 20:05:02,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:02,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:02,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:08,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:08,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:08,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020937350]
[2024-06-20 20:05:08,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020937350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:08,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:08,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:05:08,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371022583]
[2024-06-20 20:05:08,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:08,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:05:08,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:08,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:05:08,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:05:08,574 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:05:08,575 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 303 transitions, 4473 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:08,575 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:08,575 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:05:08,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:10,875 INFO  L124   PetriNetUnfolderBase]: 5005/7734 cut-off events.
[2024-06-20 20:05:10,876 INFO  L125   PetriNetUnfolderBase]: For 623848/623854 co-relation queries the response was YES.
[2024-06-20 20:05:10,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67025 conditions, 7734 events. 5005/7734 cut-off events. For 623848/623854 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 45884 event pairs, 1516 based on Foata normal form. 18/7751 useless extension candidates. Maximal degree in co-relation 66916. Up to 7423 conditions per place. 
[2024-06-20 20:05:10,980 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 281 selfloop transitions, 55 changer transitions 0/339 dead transitions.
[2024-06-20 20:05:10,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 339 transitions, 5712 flow
[2024-06-20 20:05:10,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:05:10,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:05:10,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-20 20:05:10,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-20 20:05:10,982 INFO  L175             Difference]: Start difference. First operand has 224 places, 303 transitions, 4473 flow. Second operand 9 states and 148 transitions.
[2024-06-20 20:05:10,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 339 transitions, 5712 flow
[2024-06-20 20:05:11,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 339 transitions, 5530 flow, removed 62 selfloop flow, removed 7 redundant places.
[2024-06-20 20:05:11,783 INFO  L231             Difference]: Finished difference. Result has 226 places, 310 transitions, 4706 flow
[2024-06-20 20:05:11,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4291, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4706, PETRI_PLACES=226, PETRI_TRANSITIONS=310}
[2024-06-20 20:05:11,784 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places.
[2024-06-20 20:05:11,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 310 transitions, 4706 flow
[2024-06-20 20:05:11,784 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:11,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:11,784 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:11,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 20:05:11,785 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:11,786 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:11,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 843689245, now seen corresponding path program 10 times
[2024-06-20 20:05:11,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:11,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020428847]
[2024-06-20 20:05:11,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:11,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:11,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:18,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:18,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:18,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020428847]
[2024-06-20 20:05:18,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020428847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:18,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:18,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:05:18,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387048165]
[2024-06-20 20:05:18,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:18,386 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:05:18,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:18,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:05:18,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:05:18,522 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:05:18,523 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 310 transitions, 4706 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:18,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:18,523 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:05:18,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:20,744 INFO  L124   PetriNetUnfolderBase]: 5005/7734 cut-off events.
[2024-06-20 20:05:20,745 INFO  L125   PetriNetUnfolderBase]: For 641348/641352 co-relation queries the response was YES.
[2024-06-20 20:05:20,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66401 conditions, 7734 events. 5005/7734 cut-off events. For 641348/641352 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 45792 event pairs, 1501 based on Foata normal form. 34/7767 useless extension candidates. Maximal degree in co-relation 66291. Up to 7400 conditions per place. 
[2024-06-20 20:05:20,839 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 309 selfloop transitions, 36 changer transitions 0/348 dead transitions.
[2024-06-20 20:05:20,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 348 transitions, 5644 flow
[2024-06-20 20:05:20,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:05:20,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:05:20,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions.
[2024-06-20 20:05:20,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4075
[2024-06-20 20:05:20,841 INFO  L175             Difference]: Start difference. First operand has 226 places, 310 transitions, 4706 flow. Second operand 10 states and 163 transitions.
[2024-06-20 20:05:20,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 348 transitions, 5644 flow
[2024-06-20 20:05:21,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 348 transitions, 5427 flow, removed 84 selfloop flow, removed 5 redundant places.
[2024-06-20 20:05:21,552 INFO  L231             Difference]: Finished difference. Result has 231 places, 312 transitions, 4702 flow
[2024-06-20 20:05:21,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4702, PETRI_PLACES=231, PETRI_TRANSITIONS=312}
[2024-06-20 20:05:21,553 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places.
[2024-06-20 20:05:21,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 312 transitions, 4702 flow
[2024-06-20 20:05:21,553 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:21,553 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:21,553 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:21,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 20:05:21,553 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:21,554 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:21,554 INFO  L85        PathProgramCache]: Analyzing trace with hash 1417891736, now seen corresponding path program 1 times
[2024-06-20 20:05:21,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:21,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806717372]
[2024-06-20 20:05:21,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:21,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:21,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:27,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:27,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:27,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806717372]
[2024-06-20 20:05:27,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806717372] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:27,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:27,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:27,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016055578]
[2024-06-20 20:05:27,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:27,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:27,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:27,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:27,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:27,776 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:05:27,776 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 312 transitions, 4702 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:27,776 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:27,776 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:05:27,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:29,962 INFO  L124   PetriNetUnfolderBase]: 5129/7906 cut-off events.
[2024-06-20 20:05:29,963 INFO  L125   PetriNetUnfolderBase]: For 634326/634330 co-relation queries the response was YES.
[2024-06-20 20:05:30,035 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67802 conditions, 7906 events. 5129/7906 cut-off events. For 634326/634330 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 46854 event pairs, 1516 based on Foata normal form. 11/7916 useless extension candidates. Maximal degree in co-relation 67690. Up to 7540 conditions per place. 
[2024-06-20 20:05:30,066 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 307 selfloop transitions, 55 changer transitions 0/365 dead transitions.
[2024-06-20 20:05:30,066 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 365 transitions, 6279 flow
[2024-06-20 20:05:30,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:05:30,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:05:30,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-20 20:05:30,067 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-20 20:05:30,068 INFO  L175             Difference]: Start difference. First operand has 231 places, 312 transitions, 4702 flow. Second operand 9 states and 160 transitions.
[2024-06-20 20:05:30,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 365 transitions, 6279 flow
[2024-06-20 20:05:30,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 365 transitions, 6118 flow, removed 48 selfloop flow, removed 8 redundant places.
[2024-06-20 20:05:30,929 INFO  L231             Difference]: Finished difference. Result has 235 places, 327 transitions, 5015 flow
[2024-06-20 20:05:30,929 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4541, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5015, PETRI_PLACES=235, PETRI_TRANSITIONS=327}
[2024-06-20 20:05:30,929 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 194 predicate places.
[2024-06-20 20:05:30,929 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 327 transitions, 5015 flow
[2024-06-20 20:05:30,929 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:30,930 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:30,930 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:30,930 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 20:05:30,930 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:30,930 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:30,930 INFO  L85        PathProgramCache]: Analyzing trace with hash 1109601727, now seen corresponding path program 6 times
[2024-06-20 20:05:30,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:30,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097152584]
[2024-06-20 20:05:30,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:30,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:30,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:36,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:36,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:36,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097152584]
[2024-06-20 20:05:36,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097152584] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:36,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:36,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:05:36,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294041073]
[2024-06-20 20:05:36,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:36,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:05:36,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:36,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:05:36,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:05:36,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:05:36,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 327 transitions, 5015 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:36,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:36,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:05:36,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:38,926 INFO  L124   PetriNetUnfolderBase]: 5129/7906 cut-off events.
[2024-06-20 20:05:38,926 INFO  L125   PetriNetUnfolderBase]: For 633056/633060 co-relation queries the response was YES.
[2024-06-20 20:05:38,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67597 conditions, 7906 events. 5129/7906 cut-off events. For 633056/633060 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 46661 event pairs, 1511 based on Foata normal form. 10/7915 useless extension candidates. Maximal degree in co-relation 67481. Up to 7755 conditions per place. 
[2024-06-20 20:05:39,009 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 320 selfloop transitions, 34 changer transitions 0/357 dead transitions.
[2024-06-20 20:05:39,010 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 357 transitions, 5927 flow
[2024-06-20 20:05:39,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:05:39,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:05:39,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions.
[2024-06-20 20:05:39,011 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3972222222222222
[2024-06-20 20:05:39,011 INFO  L175             Difference]: Start difference. First operand has 235 places, 327 transitions, 5015 flow. Second operand 9 states and 143 transitions.
[2024-06-20 20:05:39,011 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 357 transitions, 5927 flow
[2024-06-20 20:05:39,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 357 transitions, 5729 flow, removed 67 selfloop flow, removed 4 redundant places.
[2024-06-20 20:05:39,787 INFO  L231             Difference]: Finished difference. Result has 240 places, 330 transitions, 5037 flow
[2024-06-20 20:05:39,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4817, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5037, PETRI_PLACES=240, PETRI_TRANSITIONS=330}
[2024-06-20 20:05:39,789 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places.
[2024-06-20 20:05:39,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 330 transitions, 5037 flow
[2024-06-20 20:05:39,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:39,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:39,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:39,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 20:05:39,789 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:39,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:39,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 851046847, now seen corresponding path program 7 times
[2024-06-20 20:05:39,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:39,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588236997]
[2024-06-20 20:05:39,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:39,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:39,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:45,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:45,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:45,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588236997]
[2024-06-20 20:05:45,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588236997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:45,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:45,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:05:45,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355675220]
[2024-06-20 20:05:45,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:45,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:05:45,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:45,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:05:45,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:05:45,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:05:45,544 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 330 transitions, 5037 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:45,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:45,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:05:45,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:47,746 INFO  L124   PetriNetUnfolderBase]: 5116/7887 cut-off events.
[2024-06-20 20:05:47,746 INFO  L125   PetriNetUnfolderBase]: For 635441/635445 co-relation queries the response was YES.
[2024-06-20 20:05:47,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67142 conditions, 7887 events. 5116/7887 cut-off events. For 635441/635445 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46737 event pairs, 1535 based on Foata normal form. 10/7896 useless extension candidates. Maximal degree in co-relation 67025. Up to 7695 conditions per place. 
[2024-06-20 20:05:47,826 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 307 selfloop transitions, 47 changer transitions 0/357 dead transitions.
[2024-06-20 20:05:47,827 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 357 transitions, 5815 flow
[2024-06-20 20:05:47,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:05:47,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:05:47,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-20 20:05:47,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4027777777777778
[2024-06-20 20:05:47,828 INFO  L175             Difference]: Start difference. First operand has 240 places, 330 transitions, 5037 flow. Second operand 9 states and 145 transitions.
[2024-06-20 20:05:47,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 357 transitions, 5815 flow
[2024-06-20 20:05:48,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 357 transitions, 5527 flow, removed 112 selfloop flow, removed 7 redundant places.
[2024-06-20 20:05:48,535 INFO  L231             Difference]: Finished difference. Result has 242 places, 330 transitions, 4855 flow
[2024-06-20 20:05:48,536 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4749, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4855, PETRI_PLACES=242, PETRI_TRANSITIONS=330}
[2024-06-20 20:05:48,536 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places.
[2024-06-20 20:05:48,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 330 transitions, 4855 flow
[2024-06-20 20:05:48,536 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:48,536 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:48,537 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:48,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 20:05:48,537 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:48,537 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:48,537 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931019830, now seen corresponding path program 2 times
[2024-06-20 20:05:48,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:48,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343553430]
[2024-06-20 20:05:48,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:48,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:48,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:54,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:54,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:54,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343553430]
[2024-06-20 20:05:54,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343553430] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:54,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:54,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:05:54,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117275414]
[2024-06-20 20:05:54,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:54,452 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:05:54,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:54,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:05:54,453 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:05:54,536 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:05:54,536 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 330 transitions, 4855 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:54,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:54,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:05:54,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:56,530 INFO  L124   PetriNetUnfolderBase]: 5126/7900 cut-off events.
[2024-06-20 20:05:56,531 INFO  L125   PetriNetUnfolderBase]: For 643988/643988 co-relation queries the response was YES.
[2024-06-20 20:05:56,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67104 conditions, 7900 events. 5126/7900 cut-off events. For 643988/643988 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46786 event pairs, 1546 based on Foata normal form. 2/7901 useless extension candidates. Maximal degree in co-relation 66986. Up to 7873 conditions per place. 
[2024-06-20 20:05:56,617 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 327 selfloop transitions, 17 changer transitions 0/347 dead transitions.
[2024-06-20 20:05:56,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 347 transitions, 5637 flow
[2024-06-20 20:05:56,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:05:56,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:05:56,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions.
[2024-06-20 20:05:56,619 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3607142857142857
[2024-06-20 20:05:56,619 INFO  L175             Difference]: Start difference. First operand has 242 places, 330 transitions, 4855 flow. Second operand 7 states and 101 transitions.
[2024-06-20 20:05:56,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 347 transitions, 5637 flow
[2024-06-20 20:05:57,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 347 transitions, 5531 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-20 20:05:57,361 INFO  L231             Difference]: Finished difference. Result has 242 places, 336 transitions, 4869 flow
[2024-06-20 20:05:57,361 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4749, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4869, PETRI_PLACES=242, PETRI_TRANSITIONS=336}
[2024-06-20 20:05:57,361 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places.
[2024-06-20 20:05:57,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 336 transitions, 4869 flow
[2024-06-20 20:05:57,362 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:57,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:57,362 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:57,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 20:05:57,362 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:57,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:57,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931032292, now seen corresponding path program 3 times
[2024-06-20 20:05:57,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:57,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226954409]
[2024-06-20 20:05:57,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:57,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:57,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:03,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:03,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:03,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226954409]
[2024-06-20 20:06:03,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226954409] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:03,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:03,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:03,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064685106]
[2024-06-20 20:06:03,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:03,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:03,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:03,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:03,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:04,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:06:04,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 336 transitions, 4869 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:04,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:04,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:06:04,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:05,993 INFO  L124   PetriNetUnfolderBase]: 5120/7895 cut-off events.
[2024-06-20 20:06:05,994 INFO  L125   PetriNetUnfolderBase]: For 657856/657858 co-relation queries the response was YES.
[2024-06-20 20:06:06,063 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67225 conditions, 7895 events. 5120/7895 cut-off events. For 657856/657858 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46794 event pairs, 1552 based on Foata normal form. 6/7900 useless extension candidates. Maximal degree in co-relation 67105. Up to 7799 conditions per place. 
[2024-06-20 20:06:06,096 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 312 selfloop transitions, 34 changer transitions 0/349 dead transitions.
[2024-06-20 20:06:06,096 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 349 transitions, 5721 flow
[2024-06-20 20:06:06,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:06,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:06,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-20 20:06:06,097 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 20:06:06,097 INFO  L175             Difference]: Start difference. First operand has 242 places, 336 transitions, 4869 flow. Second operand 7 states and 112 transitions.
[2024-06-20 20:06:06,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 349 transitions, 5721 flow
[2024-06-20 20:06:07,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 349 transitions, 5667 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-20 20:06:07,056 INFO  L231             Difference]: Finished difference. Result has 246 places, 336 transitions, 4893 flow
[2024-06-20 20:06:07,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4815, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4893, PETRI_PLACES=246, PETRI_TRANSITIONS=336}
[2024-06-20 20:06:07,057 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places.
[2024-06-20 20:06:07,057 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 336 transitions, 4893 flow
[2024-06-20 20:06:07,057 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:07,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:07,058 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:07,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 20:06:07,058 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-20 20:06:07,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:07,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1499114386, now seen corresponding path program 3 times
[2024-06-20 20:06:07,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:07,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569645943]
[2024-06-20 20:06:07,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:07,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:07,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:13,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:13,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:13,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569645943]
[2024-06-20 20:06:13,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569645943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:13,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:13,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:13,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538214009]
[2024-06-20 20:06:13,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:13,413 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:13,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:13,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:13,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:13,526 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:06:13,527 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 336 transitions, 4893 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:13,527 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:13,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:06:13,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:15,593 INFO  L124   PetriNetUnfolderBase]: 5122/7896 cut-off events.
[2024-06-20 20:06:15,594 INFO  L125   PetriNetUnfolderBase]: For 670238/670238 co-relation queries the response was YES.
[2024-06-20 20:06:15,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67555 conditions, 7896 events. 5122/7896 cut-off events. For 670238/670238 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46749 event pairs, 1546 based on Foata normal form. 2/7897 useless extension candidates. Maximal degree in co-relation 67434. Up to 7856 conditions per place. 
[2024-06-20 20:06:15,676 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 325 selfloop transitions, 24 changer transitions 0/352 dead transitions.
[2024-06-20 20:06:15,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 352 transitions, 5808 flow
[2024-06-20 20:06:15,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:15,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:15,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-20 20:06:15,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-20 20:06:15,678 INFO  L175             Difference]: Start difference. First operand has 246 places, 336 transitions, 4893 flow. Second operand 7 states and 105 transitions.
[2024-06-20 20:06:15,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 352 transitions, 5808 flow
[2024-06-20 20:06:16,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 352 transitions, 5520 flow, removed 19 selfloop flow, removed 10 redundant places.
[2024-06-20 20:06:16,405 INFO  L231             Difference]: Finished difference. Result has 243 places, 339 transitions, 4714 flow
[2024-06-20 20:06:16,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4605, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4714, PETRI_PLACES=243, PETRI_TRANSITIONS=339}
[2024-06-20 20:06:16,406 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places.
[2024-06-20 20:06:16,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 339 transitions, 4714 flow
[2024-06-20 20:06:16,406 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:16,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:16,407 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:16,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 20:06:16,407 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-20 20:06:16,407 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:16,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 944511850, now seen corresponding path program 1 times
[2024-06-20 20:06:16,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:16,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35912759]
[2024-06-20 20:06:16,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:16,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:16,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:22,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:22,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:22,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35912759]
[2024-06-20 20:06:22,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35912759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:22,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:22,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:22,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736553482]
[2024-06-20 20:06:22,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:22,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:22,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:22,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:22,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:23,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:06:23,009 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 339 transitions, 4714 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:23,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:23,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:06:23,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:25,183 INFO  L124   PetriNetUnfolderBase]: 5120/7894 cut-off events.
[2024-06-20 20:06:25,183 INFO  L125   PetriNetUnfolderBase]: For 685523/685523 co-relation queries the response was YES.
[2024-06-20 20:06:25,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67014 conditions, 7894 events. 5120/7894 cut-off events. For 685523/685523 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46735 event pairs, 1539 based on Foata normal form. 6/7899 useless extension candidates. Maximal degree in co-relation 66894. Up to 7755 conditions per place. 
[2024-06-20 20:06:25,269 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 323 selfloop transitions, 34 changer transitions 0/360 dead transitions.
[2024-06-20 20:06:25,270 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 360 transitions, 5645 flow
[2024-06-20 20:06:25,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:25,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:25,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-20 20:06:25,271 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-20 20:06:25,271 INFO  L175             Difference]: Start difference. First operand has 243 places, 339 transitions, 4714 flow. Second operand 7 states and 116 transitions.
[2024-06-20 20:06:25,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 360 transitions, 5645 flow
[2024-06-20 20:06:26,133 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 360 transitions, 5557 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-20 20:06:26,138 INFO  L231             Difference]: Finished difference. Result has 245 places, 342 transitions, 4743 flow
[2024-06-20 20:06:26,138 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4628, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4743, PETRI_PLACES=245, PETRI_TRANSITIONS=342}
[2024-06-20 20:06:26,138 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places.
[2024-06-20 20:06:26,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 342 transitions, 4743 flow
[2024-06-20 20:06:26,139 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:26,139 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:26,139 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:26,139 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 20:06:26,139 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-20 20:06:26,140 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:26,140 INFO  L85        PathProgramCache]: Analyzing trace with hash -1943551446, now seen corresponding path program 2 times
[2024-06-20 20:06:26,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:26,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714600931]
[2024-06-20 20:06:26,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:26,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:26,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:32,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:32,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:32,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714600931]
[2024-06-20 20:06:32,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714600931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:32,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:32,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:32,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081275134]
[2024-06-20 20:06:32,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:32,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:32,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:32,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:32,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:32,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:06:32,601 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 342 transitions, 4743 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:32,601 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:32,601 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:06:32,601 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:34,749 INFO  L124   PetriNetUnfolderBase]: 5130/7910 cut-off events.
[2024-06-20 20:06:34,750 INFO  L125   PetriNetUnfolderBase]: For 676080/676082 co-relation queries the response was YES.
[2024-06-20 20:06:34,818 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67105 conditions, 7910 events. 5130/7910 cut-off events. For 676080/676082 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46781 event pairs, 1554 based on Foata normal form. 2/7911 useless extension candidates. Maximal degree in co-relation 66984. Up to 7761 conditions per place. 
[2024-06-20 20:06:34,847 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 322 selfloop transitions, 38 changer transitions 0/363 dead transitions.
[2024-06-20 20:06:34,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 363 transitions, 5818 flow
[2024-06-20 20:06:34,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:34,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:34,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-20 20:06:34,850 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-20 20:06:34,850 INFO  L175             Difference]: Start difference. First operand has 245 places, 342 transitions, 4743 flow. Second operand 7 states and 115 transitions.
[2024-06-20 20:06:34,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 363 transitions, 5818 flow
[2024-06-20 20:06:35,747 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 363 transitions, 5749 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-20 20:06:35,751 INFO  L231             Difference]: Finished difference. Result has 248 places, 345 transitions, 4799 flow
[2024-06-20 20:06:35,752 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4676, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4799, PETRI_PLACES=248, PETRI_TRANSITIONS=345}
[2024-06-20 20:06:35,752 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 207 predicate places.
[2024-06-20 20:06:35,752 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 345 transitions, 4799 flow
[2024-06-20 20:06:35,752 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:35,752 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:35,753 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:35,753 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 20:06:35,753 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:35,753 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:35,753 INFO  L85        PathProgramCache]: Analyzing trace with hash 1499536048, now seen corresponding path program 3 times
[2024-06-20 20:06:35,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:35,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897789905]
[2024-06-20 20:06:35,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:35,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:35,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:43,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:43,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:43,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897789905]
[2024-06-20 20:06:43,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897789905] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:43,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:43,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:43,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735194782]
[2024-06-20 20:06:43,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:43,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:43,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:43,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:43,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:43,866 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:06:43,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 345 transitions, 4799 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:43,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:43,867 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:06:43,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:45,896 INFO  L124   PetriNetUnfolderBase]: 5124/7901 cut-off events.
[2024-06-20 20:06:45,896 INFO  L125   PetriNetUnfolderBase]: For 689931/689935 co-relation queries the response was YES.
[2024-06-20 20:06:45,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67158 conditions, 7901 events. 5124/7901 cut-off events. For 689931/689935 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46736 event pairs, 1540 based on Foata normal form. 6/7906 useless extension candidates. Maximal degree in co-relation 67036. Up to 7758 conditions per place. 
[2024-06-20 20:06:45,983 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 321 selfloop transitions, 41 changer transitions 0/365 dead transitions.
[2024-06-20 20:06:45,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 365 transitions, 5711 flow
[2024-06-20 20:06:45,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:45,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:45,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-20 20:06:45,984 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.396875
[2024-06-20 20:06:45,984 INFO  L175             Difference]: Start difference. First operand has 248 places, 345 transitions, 4799 flow. Second operand 8 states and 127 transitions.
[2024-06-20 20:06:45,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 365 transitions, 5711 flow
[2024-06-20 20:06:46,802 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 365 transitions, 5571 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 20:06:46,806 INFO  L231             Difference]: Finished difference. Result has 250 places, 345 transitions, 4748 flow
[2024-06-20 20:06:46,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4659, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4748, PETRI_PLACES=250, PETRI_TRANSITIONS=345}
[2024-06-20 20:06:46,807 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places.
[2024-06-20 20:06:46,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 345 transitions, 4748 flow
[2024-06-20 20:06:46,807 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:46,807 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:46,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:46,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 20:06:46,807 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:46,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:46,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 1499544976, now seen corresponding path program 1 times
[2024-06-20 20:06:46,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:46,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167768582]
[2024-06-20 20:06:46,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:46,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:46,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:55,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:55,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:55,065 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167768582]
[2024-06-20 20:06:55,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167768582] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:55,065 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:55,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:55,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372331922]
[2024-06-20 20:06:55,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:55,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:55,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:55,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:55,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:55,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:06:55,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 345 transitions, 4748 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:55,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:55,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:06:55,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:57,232 INFO  L124   PetriNetUnfolderBase]: 5119/7893 cut-off events.
[2024-06-20 20:06:57,232 INFO  L125   PetriNetUnfolderBase]: For 702311/702311 co-relation queries the response was YES.
[2024-06-20 20:06:57,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67204 conditions, 7893 events. 5119/7893 cut-off events. For 702311/702311 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46525 event pairs, 1513 based on Foata normal form. 2/7894 useless extension candidates. Maximal degree in co-relation 67081. Up to 7866 conditions per place. 
[2024-06-20 20:06:57,321 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 340 selfloop transitions, 15 changer transitions 0/358 dead transitions.
[2024-06-20 20:06:57,321 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 358 transitions, 5520 flow
[2024-06-20 20:06:57,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:57,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:57,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions.
[2024-06-20 20:06:57,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-20 20:06:57,322 INFO  L175             Difference]: Start difference. First operand has 250 places, 345 transitions, 4748 flow. Second operand 7 states and 100 transitions.
[2024-06-20 20:06:57,322 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 358 transitions, 5520 flow
[2024-06-20 20:06:58,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 358 transitions, 5417 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-20 20:06:58,145 INFO  L231             Difference]: Finished difference. Result has 249 places, 347 transitions, 4720 flow
[2024-06-20 20:06:58,145 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4645, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4720, PETRI_PLACES=249, PETRI_TRANSITIONS=347}
[2024-06-20 20:06:58,145 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 208 predicate places.
[2024-06-20 20:06:58,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 347 transitions, 4720 flow
[2024-06-20 20:06:58,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:58,146 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:58,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-20 20:06:58,146 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 20:06:58,146 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:58,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:58,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -2134200375, now seen corresponding path program 1 times
[2024-06-20 20:06:58,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:58,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006167508]
[2024-06-20 20:06:58,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:58,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:58,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:05,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:05,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:05,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006167508]
[2024-06-20 20:07:05,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006167508] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:05,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:05,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:05,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117458313]
[2024-06-20 20:07:05,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:05,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:05,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:05,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:05,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:05,164 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:07:05,164 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 347 transitions, 4720 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:05,164 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:05,165 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:07:05,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:07,376 INFO  L124   PetriNetUnfolderBase]: 5144/7929 cut-off events.
[2024-06-20 20:07:07,377 INFO  L125   PetriNetUnfolderBase]: For 728118/728122 co-relation queries the response was YES.
[2024-06-20 20:07:07,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67819 conditions, 7929 events. 5144/7929 cut-off events. For 728118/728122 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46938 event pairs, 1189 based on Foata normal form. 9/7937 useless extension candidates. Maximal degree in co-relation 67696. Up to 6518 conditions per place. 
[2024-06-20 20:07:07,474 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 262 selfloop transitions, 140 changer transitions 0/405 dead transitions.
[2024-06-20 20:07:07,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 405 transitions, 6471 flow
[2024-06-20 20:07:07,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:07:07,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:07:07,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-20 20:07:07,475 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4861111111111111
[2024-06-20 20:07:07,475 INFO  L175             Difference]: Start difference. First operand has 249 places, 347 transitions, 4720 flow. Second operand 9 states and 175 transitions.
[2024-06-20 20:07:07,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 405 transitions, 6471 flow
[2024-06-20 20:07:08,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 405 transitions, 6412 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-20 20:07:08,776 INFO  L231             Difference]: Finished difference. Result has 253 places, 355 transitions, 5114 flow
[2024-06-20 20:07:08,776 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4661, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5114, PETRI_PLACES=253, PETRI_TRANSITIONS=355}
[2024-06-20 20:07:08,776 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places.
[2024-06-20 20:07:08,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 355 transitions, 5114 flow
[2024-06-20 20:07:08,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:08,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:08,777 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:08,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 20:07:08,777 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:08,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:08,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -2133931264, now seen corresponding path program 1 times
[2024-06-20 20:07:08,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:08,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493691896]
[2024-06-20 20:07:08,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:08,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:08,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:15,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:15,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:15,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493691896]
[2024-06-20 20:07:15,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493691896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:15,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:15,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:15,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142607135]
[2024-06-20 20:07:15,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:15,580 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:15,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:15,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:15,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:15,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:07:15,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 355 transitions, 5114 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:15,741 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:15,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:07:15,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:18,087 INFO  L124   PetriNetUnfolderBase]: 5404/8291 cut-off events.
[2024-06-20 20:07:18,087 INFO  L125   PetriNetUnfolderBase]: For 827555/827559 co-relation queries the response was YES.
[2024-06-20 20:07:18,145 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73271 conditions, 8291 events. 5404/8291 cut-off events. For 827555/827559 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 49034 event pairs, 1123 based on Foata normal form. 20/8310 useless extension candidates. Maximal degree in co-relation 73147. Up to 6286 conditions per place. 
[2024-06-20 20:07:18,176 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 250 selfloop transitions, 176 changer transitions 0/429 dead transitions.
[2024-06-20 20:07:18,176 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 429 transitions, 7319 flow
[2024-06-20 20:07:18,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:07:18,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:07:18,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 20:07:18,178 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48055555555555557
[2024-06-20 20:07:18,178 INFO  L175             Difference]: Start difference. First operand has 253 places, 355 transitions, 5114 flow. Second operand 9 states and 173 transitions.
[2024-06-20 20:07:18,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 429 transitions, 7319 flow
[2024-06-20 20:07:19,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 429 transitions, 7063 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-20 20:07:19,181 INFO  L231             Difference]: Finished difference. Result has 258 places, 383 transitions, 5830 flow
[2024-06-20 20:07:19,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4871, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5830, PETRI_PLACES=258, PETRI_TRANSITIONS=383}
[2024-06-20 20:07:19,181 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places.
[2024-06-20 20:07:19,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 383 transitions, 5830 flow
[2024-06-20 20:07:19,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:19,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:19,182 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:19,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 20:07:19,182 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:19,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:19,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -2133931605, now seen corresponding path program 2 times
[2024-06-20 20:07:19,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:19,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414501904]
[2024-06-20 20:07:19,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:19,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:19,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:26,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:26,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:26,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414501904]
[2024-06-20 20:07:26,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414501904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:26,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:26,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:26,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837724522]
[2024-06-20 20:07:26,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:26,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:26,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:26,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:26,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:26,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:07:26,522 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 383 transitions, 5830 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:26,522 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:26,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:07:26,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:28,716 INFO  L124   PetriNetUnfolderBase]: 5380/8257 cut-off events.
[2024-06-20 20:07:28,717 INFO  L125   PetriNetUnfolderBase]: For 816312/816316 co-relation queries the response was YES.
[2024-06-20 20:07:28,782 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74551 conditions, 8257 events. 5380/8257 cut-off events. For 816312/816316 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 48946 event pairs, 1335 based on Foata normal form. 8/8264 useless extension candidates. Maximal degree in co-relation 74425. Up to 7747 conditions per place. 
[2024-06-20 20:07:28,817 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 332 selfloop transitions, 81 changer transitions 0/416 dead transitions.
[2024-06-20 20:07:28,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 416 transitions, 6901 flow
[2024-06-20 20:07:28,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:07:28,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:07:28,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 20:07:28,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 20:07:28,819 INFO  L175             Difference]: Start difference. First operand has 258 places, 383 transitions, 5830 flow. Second operand 9 states and 156 transitions.
[2024-06-20 20:07:28,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 416 transitions, 6901 flow
[2024-06-20 20:07:30,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 416 transitions, 6717 flow, removed 74 selfloop flow, removed 4 redundant places.
[2024-06-20 20:07:30,117 INFO  L231             Difference]: Finished difference. Result has 263 places, 384 transitions, 5837 flow
[2024-06-20 20:07:30,117 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5650, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5837, PETRI_PLACES=263, PETRI_TRANSITIONS=384}
[2024-06-20 20:07:30,117 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places.
[2024-06-20 20:07:30,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 384 transitions, 5837 flow
[2024-06-20 20:07:30,118 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:30,118 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:30,118 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:30,118 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-20 20:07:30,118 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:30,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:30,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 1946389269, now seen corresponding path program 1 times
[2024-06-20 20:07:30,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:30,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951335379]
[2024-06-20 20:07:30,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:30,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:30,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:36,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:36,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:36,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951335379]
[2024-06-20 20:07:36,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951335379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:36,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:36,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:07:36,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088992508]
[2024-06-20 20:07:36,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:36,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:07:36,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:36,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:07:36,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:07:37,002 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:07:37,003 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 384 transitions, 5837 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:37,003 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:37,003 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:07:37,003 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:39,348 INFO  L124   PetriNetUnfolderBase]: 5378/8255 cut-off events.
[2024-06-20 20:07:39,349 INFO  L125   PetriNetUnfolderBase]: For 825165/825169 co-relation queries the response was YES.
[2024-06-20 20:07:39,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73621 conditions, 8255 events. 5378/8255 cut-off events. For 825165/825169 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 48864 event pairs, 1374 based on Foata normal form. 10/8264 useless extension candidates. Maximal degree in co-relation 73494. Up to 7759 conditions per place. 
[2024-06-20 20:07:39,439 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 341 selfloop transitions, 72 changer transitions 0/416 dead transitions.
[2024-06-20 20:07:39,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 416 transitions, 7092 flow
[2024-06-20 20:07:39,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:07:39,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:07:39,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 20:07:39,440 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 20:07:39,441 INFO  L175             Difference]: Start difference. First operand has 263 places, 384 transitions, 5837 flow. Second operand 8 states and 140 transitions.
[2024-06-20 20:07:39,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 416 transitions, 7092 flow
[2024-06-20 20:07:40,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 416 transitions, 6880 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-20 20:07:40,359 INFO  L231             Difference]: Finished difference. Result has 264 places, 388 transitions, 5851 flow
[2024-06-20 20:07:40,359 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5631, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5851, PETRI_PLACES=264, PETRI_TRANSITIONS=388}
[2024-06-20 20:07:40,359 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places.
[2024-06-20 20:07:40,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 388 transitions, 5851 flow
[2024-06-20 20:07:40,360 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:40,360 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:40,360 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:40,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-20 20:07:40,360 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:40,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:40,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 1952103189, now seen corresponding path program 2 times
[2024-06-20 20:07:40,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:40,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680435663]
[2024-06-20 20:07:40,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:40,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:40,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:46,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:46,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:46,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680435663]
[2024-06-20 20:07:46,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680435663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:46,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:46,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:07:46,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506448947]
[2024-06-20 20:07:46,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:46,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:07:46,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:46,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:07:46,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:07:46,774 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:07:46,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 388 transitions, 5851 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:46,775 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:46,775 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:07:46,775 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:48,863 INFO  L124   PetriNetUnfolderBase]: 5372/8247 cut-off events.
[2024-06-20 20:07:48,864 INFO  L125   PetriNetUnfolderBase]: For 828641/828645 co-relation queries the response was YES.
[2024-06-20 20:07:48,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73551 conditions, 8247 events. 5372/8247 cut-off events. For 828641/828645 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 48806 event pairs, 1376 based on Foata normal form. 6/8252 useless extension candidates. Maximal degree in co-relation 73423. Up to 7756 conditions per place. 
[2024-06-20 20:07:48,962 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 333 selfloop transitions, 76 changer transitions 0/412 dead transitions.
[2024-06-20 20:07:48,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 412 transitions, 7019 flow
[2024-06-20 20:07:48,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:07:48,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:07:48,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-20 20:07:48,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.421875
[2024-06-20 20:07:48,963 INFO  L175             Difference]: Start difference. First operand has 264 places, 388 transitions, 5851 flow. Second operand 8 states and 135 transitions.
[2024-06-20 20:07:48,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 412 transitions, 7019 flow
[2024-06-20 20:07:50,141 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 412 transitions, 6898 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 20:07:50,146 INFO  L231             Difference]: Finished difference. Result has 267 places, 388 transitions, 5891 flow
[2024-06-20 20:07:50,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5730, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5891, PETRI_PLACES=267, PETRI_TRANSITIONS=388}
[2024-06-20 20:07:50,146 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 226 predicate places.
[2024-06-20 20:07:50,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 388 transitions, 5891 flow
[2024-06-20 20:07:50,147 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:50,147 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:50,147 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:50,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-20 20:07:50,147 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:50,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:50,148 INFO  L85        PathProgramCache]: Analyzing trace with hash 960023498, now seen corresponding path program 1 times
[2024-06-20 20:07:50,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:50,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655390444]
[2024-06-20 20:07:50,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:50,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:50,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:56,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:56,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:56,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655390444]
[2024-06-20 20:07:56,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655390444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:56,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:56,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:07:56,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590572562]
[2024-06-20 20:07:56,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:56,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:07:56,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:56,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:07:56,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:07:56,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:07:56,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 388 transitions, 5891 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:56,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:56,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:07:56,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:59,204 INFO  L124   PetriNetUnfolderBase]: 5928/9115 cut-off events.
[2024-06-20 20:07:59,204 INFO  L125   PetriNetUnfolderBase]: For 1144505/1144509 co-relation queries the response was YES.
[2024-06-20 20:07:59,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83104 conditions, 9115 events. 5928/9115 cut-off events. For 1144505/1144509 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 54917 event pairs, 1249 based on Foata normal form. 58/9172 useless extension candidates. Maximal degree in co-relation 82975. Up to 7013 conditions per place. 
[2024-06-20 20:07:59,316 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 351 selfloop transitions, 117 changer transitions 0/471 dead transitions.
[2024-06-20 20:07:59,316 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 471 transitions, 8256 flow
[2024-06-20 20:07:59,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:07:59,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:07:59,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 20:07:59,317 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.495
[2024-06-20 20:07:59,317 INFO  L175             Difference]: Start difference. First operand has 267 places, 388 transitions, 5891 flow. Second operand 10 states and 198 transitions.
[2024-06-20 20:07:59,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 471 transitions, 8256 flow
[2024-06-20 20:08:00,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 471 transitions, 8133 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 20:08:00,553 INFO  L231             Difference]: Finished difference. Result has 274 places, 403 transitions, 6476 flow
[2024-06-20 20:08:00,554 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5768, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6476, PETRI_PLACES=274, PETRI_TRANSITIONS=403}
[2024-06-20 20:08:00,554 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 233 predicate places.
[2024-06-20 20:08:00,554 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 403 transitions, 6476 flow
[2024-06-20 20:08:00,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:00,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:00,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:00,555 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-20 20:08:00,555 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:00,555 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:00,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 1952099221, now seen corresponding path program 3 times
[2024-06-20 20:08:00,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:00,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756400318]
[2024-06-20 20:08:00,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:00,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:00,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:07,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:07,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:07,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756400318]
[2024-06-20 20:08:07,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756400318] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:07,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:07,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:07,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940828122]
[2024-06-20 20:08:07,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:07,413 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:07,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:07,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:07,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:07,576 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:08:07,576 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 403 transitions, 6476 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:07,576 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:07,576 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:08:07,576 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:10,301 INFO  L124   PetriNetUnfolderBase]: 6177/9462 cut-off events.
[2024-06-20 20:08:10,301 INFO  L125   PetriNetUnfolderBase]: For 1131337/1131341 co-relation queries the response was YES.
[2024-06-20 20:08:10,380 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89668 conditions, 9462 events. 6177/9462 cut-off events. For 1131337/1131341 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 57026 event pairs, 1437 based on Foata normal form. 17/9478 useless extension candidates. Maximal degree in co-relation 89536. Up to 8052 conditions per place. 
[2024-06-20 20:08:10,417 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 330 selfloop transitions, 131 changer transitions 0/464 dead transitions.
[2024-06-20 20:08:10,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 464 transitions, 8707 flow
[2024-06-20 20:08:10,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:08:10,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:08:10,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-20 20:08:10,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45555555555555555
[2024-06-20 20:08:10,420 INFO  L175             Difference]: Start difference. First operand has 274 places, 403 transitions, 6476 flow. Second operand 9 states and 164 transitions.
[2024-06-20 20:08:10,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 464 transitions, 8707 flow
[2024-06-20 20:08:11,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 464 transitions, 8507 flow, removed 84 selfloop flow, removed 3 redundant places.
[2024-06-20 20:08:11,975 INFO  L231             Difference]: Finished difference. Result has 282 places, 426 transitions, 7161 flow
[2024-06-20 20:08:11,975 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6300, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7161, PETRI_PLACES=282, PETRI_TRANSITIONS=426}
[2024-06-20 20:08:11,976 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 241 predicate places.
[2024-06-20 20:08:11,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 426 transitions, 7161 flow
[2024-06-20 20:08:11,976 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:11,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:11,976 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:11,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-20 20:08:11,976 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:11,977 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:11,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -2124676834, now seen corresponding path program 2 times
[2024-06-20 20:08:11,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:11,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143442121]
[2024-06-20 20:08:11,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:11,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:12,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:18,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:18,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:18,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143442121]
[2024-06-20 20:08:18,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143442121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:18,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:18,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:18,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118562679]
[2024-06-20 20:08:18,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:18,513 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:18,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:18,513 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:18,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:18,641 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:08:18,641 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 426 transitions, 7161 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:18,641 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:18,641 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:08:18,641 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:21,271 INFO  L124   PetriNetUnfolderBase]: 6409/9786 cut-off events.
[2024-06-20 20:08:21,271 INFO  L125   PetriNetUnfolderBase]: For 1213855/1213859 co-relation queries the response was YES.
[2024-06-20 20:08:21,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93923 conditions, 9786 events. 6409/9786 cut-off events. For 1213855/1213859 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 58998 event pairs, 1376 based on Foata normal form. 20/9805 useless extension candidates. Maximal degree in co-relation 93787. Up to 7254 conditions per place. 
[2024-06-20 20:08:21,597 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 277 selfloop transitions, 211 changer transitions 0/491 dead transitions.
[2024-06-20 20:08:21,597 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 491 transitions, 9455 flow
[2024-06-20 20:08:21,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:08:21,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:08:21,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-20 20:08:21,598 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4638888888888889
[2024-06-20 20:08:21,598 INFO  L175             Difference]: Start difference. First operand has 282 places, 426 transitions, 7161 flow. Second operand 9 states and 167 transitions.
[2024-06-20 20:08:21,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 491 transitions, 9455 flow
[2024-06-20 20:08:23,211 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 491 transitions, 9193 flow, removed 73 selfloop flow, removed 4 redundant places.
[2024-06-20 20:08:23,217 INFO  L231             Difference]: Finished difference. Result has 289 places, 451 transitions, 7956 flow
[2024-06-20 20:08:23,217 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6917, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7956, PETRI_PLACES=289, PETRI_TRANSITIONS=451}
[2024-06-20 20:08:23,218 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 248 predicate places.
[2024-06-20 20:08:23,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 451 transitions, 7956 flow
[2024-06-20 20:08:23,218 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:23,218 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:23,218 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:23,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-20 20:08:23,218 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:23,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:23,219 INFO  L85        PathProgramCache]: Analyzing trace with hash -2124665674, now seen corresponding path program 3 times
[2024-06-20 20:08:23,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:23,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805782120]
[2024-06-20 20:08:23,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:23,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:23,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:29,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:29,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:29,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805782120]
[2024-06-20 20:08:29,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805782120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:29,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:29,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:08:29,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805777451]
[2024-06-20 20:08:29,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:29,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:08:29,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:29,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:08:29,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:08:29,322 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:08:29,322 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 451 transitions, 7956 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:29,322 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:29,322 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:08:29,322 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:31,942 INFO  L124   PetriNetUnfolderBase]: 6393/9767 cut-off events.
[2024-06-20 20:08:31,942 INFO  L125   PetriNetUnfolderBase]: For 1203380/1203382 co-relation queries the response was YES.
[2024-06-20 20:08:32,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94605 conditions, 9767 events. 6393/9767 cut-off events. For 1203380/1203382 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 58808 event pairs, 1385 based on Foata normal form. 8/9774 useless extension candidates. Maximal degree in co-relation 94466. Up to 7250 conditions per place. 
[2024-06-20 20:08:32,063 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 271 selfloop transitions, 217 changer transitions 0/491 dead transitions.
[2024-06-20 20:08:32,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 491 transitions, 9876 flow
[2024-06-20 20:08:32,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:08:32,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:08:32,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-20 20:08:32,064 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.471875
[2024-06-20 20:08:32,064 INFO  L175             Difference]: Start difference. First operand has 289 places, 451 transitions, 7956 flow. Second operand 8 states and 151 transitions.
[2024-06-20 20:08:32,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 491 transitions, 9876 flow
[2024-06-20 20:08:33,883 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 491 transitions, 9549 flow, removed 80 selfloop flow, removed 4 redundant places.
[2024-06-20 20:08:33,889 INFO  L231             Difference]: Finished difference. Result has 295 places, 458 transitions, 8393 flow
[2024-06-20 20:08:33,890 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7633, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8393, PETRI_PLACES=295, PETRI_TRANSITIONS=458}
[2024-06-20 20:08:33,890 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places.
[2024-06-20 20:08:33,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 458 transitions, 8393 flow
[2024-06-20 20:08:33,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:33,890 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:33,890 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:33,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-20 20:08:33,891 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:33,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:33,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 2031004425, now seen corresponding path program 3 times
[2024-06-20 20:08:33,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:33,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212669605]
[2024-06-20 20:08:33,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:33,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:33,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:40,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:40,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:40,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212669605]
[2024-06-20 20:08:40,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212669605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:40,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:40,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:08:40,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503068339]
[2024-06-20 20:08:40,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:40,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:08:40,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:40,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:08:40,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:08:40,498 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:08:40,498 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 458 transitions, 8393 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:40,498 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:40,499 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:08:40,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:43,268 INFO  L124   PetriNetUnfolderBase]: 6356/9711 cut-off events.
[2024-06-20 20:08:43,268 INFO  L125   PetriNetUnfolderBase]: For 1217994/1217994 co-relation queries the response was YES.
[2024-06-20 20:08:43,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94865 conditions, 9711 events. 6356/9711 cut-off events. For 1217994/1217994 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 58550 event pairs, 1905 based on Foata normal form. 3/9713 useless extension candidates. Maximal degree in co-relation 94723. Up to 9573 conditions per place. 
[2024-06-20 20:08:43,382 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 440 selfloop transitions, 35 changer transitions 0/478 dead transitions.
[2024-06-20 20:08:43,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 478 transitions, 9570 flow
[2024-06-20 20:08:43,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:08:43,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:08:43,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-20 20:08:43,383 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38125
[2024-06-20 20:08:43,383 INFO  L175             Difference]: Start difference. First operand has 295 places, 458 transitions, 8393 flow. Second operand 8 states and 122 transitions.
[2024-06-20 20:08:43,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 478 transitions, 9570 flow
[2024-06-20 20:08:45,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 478 transitions, 9298 flow, removed 55 selfloop flow, removed 3 redundant places.
[2024-06-20 20:08:45,088 INFO  L231             Difference]: Finished difference. Result has 301 places, 460 transitions, 8230 flow
[2024-06-20 20:08:45,088 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8122, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8230, PETRI_PLACES=301, PETRI_TRANSITIONS=460}
[2024-06-20 20:08:45,088 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places.
[2024-06-20 20:08:45,089 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 460 transitions, 8230 flow
[2024-06-20 20:08:45,089 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:45,089 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:45,089 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:45,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-20 20:08:45,089 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:45,089 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:45,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -1986168307, now seen corresponding path program 4 times
[2024-06-20 20:08:45,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:45,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536599570]
[2024-06-20 20:08:45,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:45,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:45,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:50,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:50,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:50,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536599570]
[2024-06-20 20:08:50,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536599570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:50,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:50,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:08:50,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210551197]
[2024-06-20 20:08:50,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:50,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:08:50,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:50,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:08:50,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:08:51,086 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:08:51,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 460 transitions, 8230 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:51,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:51,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:08:51,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:53,739 INFO  L124   PetriNetUnfolderBase]: 6351/9704 cut-off events.
[2024-06-20 20:08:53,739 INFO  L125   PetriNetUnfolderBase]: For 1235178/1235178 co-relation queries the response was YES.
[2024-06-20 20:08:53,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93551 conditions, 9704 events. 6351/9704 cut-off events. For 1235178/1235178 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58446 event pairs, 1903 based on Foata normal form. 3/9706 useless extension candidates. Maximal degree in co-relation 93407. Up to 9648 conditions per place. 
[2024-06-20 20:08:53,871 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 449 selfloop transitions, 24 changer transitions 0/476 dead transitions.
[2024-06-20 20:08:53,871 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 476 transitions, 9264 flow
[2024-06-20 20:08:53,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:08:53,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:08:53,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-20 20:08:53,872 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38571428571428573
[2024-06-20 20:08:53,872 INFO  L175             Difference]: Start difference. First operand has 301 places, 460 transitions, 8230 flow. Second operand 7 states and 108 transitions.
[2024-06-20 20:08:53,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 476 transitions, 9264 flow
[2024-06-20 20:08:55,637 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 476 transitions, 9166 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-20 20:08:55,644 INFO  L231             Difference]: Finished difference. Result has 303 places, 463 transitions, 8247 flow
[2024-06-20 20:08:55,644 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8134, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8247, PETRI_PLACES=303, PETRI_TRANSITIONS=463}
[2024-06-20 20:08:55,644 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places.
[2024-06-20 20:08:55,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 303 places, 463 transitions, 8247 flow
[2024-06-20 20:08:55,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:55,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:55,645 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:55,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-20 20:08:55,645 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:55,645 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:55,645 INFO  L85        PathProgramCache]: Analyzing trace with hash 820412632, now seen corresponding path program 1 times
[2024-06-20 20:08:55,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:55,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976335860]
[2024-06-20 20:08:55,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:55,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:55,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:01,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:01,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:01,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976335860]
[2024-06-20 20:09:01,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976335860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:01,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:01,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:09:01,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708891472]
[2024-06-20 20:09:01,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:01,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:09:01,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:01,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:09:01,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:09:01,350 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:09:01,351 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 463 transitions, 8247 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:01,351 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:01,351 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:09:01,351 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:04,278 INFO  L124   PetriNetUnfolderBase]: 6661/10231 cut-off events.
[2024-06-20 20:09:04,278 INFO  L125   PetriNetUnfolderBase]: For 1471878/1471882 co-relation queries the response was YES.
[2024-06-20 20:09:04,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96402 conditions, 10231 events. 6661/10231 cut-off events. For 1471878/1471882 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 62555 event pairs, 1990 based on Foata normal form. 72/10302 useless extension candidates. Maximal degree in co-relation 96256. Up to 9232 conditions per place. 
[2024-06-20 20:09:04,419 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 446 selfloop transitions, 65 changer transitions 0/514 dead transitions.
[2024-06-20 20:09:04,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 514 transitions, 10075 flow
[2024-06-20 20:09:04,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:04,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:04,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 20:09:04,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46944444444444444
[2024-06-20 20:09:04,420 INFO  L175             Difference]: Start difference. First operand has 303 places, 463 transitions, 8247 flow. Second operand 9 states and 169 transitions.
[2024-06-20 20:09:04,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 514 transitions, 10075 flow
[2024-06-20 20:09:06,637 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 514 transitions, 10014 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-20 20:09:06,644 INFO  L231             Difference]: Finished difference. Result has 307 places, 467 transitions, 8499 flow
[2024-06-20 20:09:06,644 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8186, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8499, PETRI_PLACES=307, PETRI_TRANSITIONS=467}
[2024-06-20 20:09:06,644 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 266 predicate places.
[2024-06-20 20:09:06,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 467 transitions, 8499 flow
[2024-06-20 20:09:06,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:06,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:06,645 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:06,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-20 20:09:06,645 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:06,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:06,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 391234922, now seen corresponding path program 2 times
[2024-06-20 20:09:06,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:06,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275963683]
[2024-06-20 20:09:06,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:06,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:06,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:13,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:13,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:13,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275963683]
[2024-06-20 20:09:13,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275963683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:13,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:13,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:09:13,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821595477]
[2024-06-20 20:09:13,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:13,449 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:09:13,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:13,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:09:13,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:09:13,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:09:13,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 467 transitions, 8499 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:13,586 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:13,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:09:13,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:16,597 INFO  L124   PetriNetUnfolderBase]: 6661/10231 cut-off events.
[2024-06-20 20:09:16,598 INFO  L125   PetriNetUnfolderBase]: For 1314045/1314049 co-relation queries the response was YES.
[2024-06-20 20:09:16,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96392 conditions, 10231 events. 6661/10231 cut-off events. For 1314045/1314049 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 62613 event pairs, 2048 based on Foata normal form. 22/10252 useless extension candidates. Maximal degree in co-relation 96245. Up to 9956 conditions per place. 
[2024-06-20 20:09:16,742 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 462 selfloop transitions, 39 changer transitions 0/504 dead transitions.
[2024-06-20 20:09:16,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 504 transitions, 9736 flow
[2024-06-20 20:09:16,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:09:16,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:09:16,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions.
[2024-06-20 20:09:16,743 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 20:09:16,743 INFO  L175             Difference]: Start difference. First operand has 307 places, 467 transitions, 8499 flow. Second operand 10 states and 160 transitions.
[2024-06-20 20:09:16,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 504 transitions, 9736 flow
[2024-06-20 20:09:19,034 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 504 transitions, 9503 flow, removed 56 selfloop flow, removed 7 redundant places.
[2024-06-20 20:09:19,040 INFO  L231             Difference]: Finished difference. Result has 311 places, 471 transitions, 8502 flow
[2024-06-20 20:09:19,041 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8266, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8502, PETRI_PLACES=311, PETRI_TRANSITIONS=471}
[2024-06-20 20:09:19,041 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 270 predicate places.
[2024-06-20 20:09:19,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 311 places, 471 transitions, 8502 flow
[2024-06-20 20:09:19,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:19,041 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:19,041 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:19,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-20 20:09:19,042 INFO  L420      AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:19,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:19,042 INFO  L85        PathProgramCache]: Analyzing trace with hash 37916010, now seen corresponding path program 3 times
[2024-06-20 20:09:19,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:19,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516062739]
[2024-06-20 20:09:19,042 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:19,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:19,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:24,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:24,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:24,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516062739]
[2024-06-20 20:09:24,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516062739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:24,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:24,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:09:24,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152553875]
[2024-06-20 20:09:24,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:24,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:09:24,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:24,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:09:24,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:09:24,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:09:24,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 471 transitions, 8502 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:24,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:24,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:09:24,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:27,926 INFO  L124   PetriNetUnfolderBase]: 7082/10910 cut-off events.
[2024-06-20 20:09:27,927 INFO  L125   PetriNetUnfolderBase]: For 1590838/1590842 co-relation queries the response was YES.
[2024-06-20 20:09:28,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102772 conditions, 10910 events. 7082/10910 cut-off events. For 1590838/1590842 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 67669 event pairs, 2102 based on Foata normal form. 58/10967 useless extension candidates. Maximal degree in co-relation 102623. Up to 9988 conditions per place. 
[2024-06-20 20:09:28,304 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 488 selfloop transitions, 45 changer transitions 0/536 dead transitions.
[2024-06-20 20:09:28,304 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 536 transitions, 10682 flow
[2024-06-20 20:09:28,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:28,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:28,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 20:09:28,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-06-20 20:09:28,306 INFO  L175             Difference]: Start difference. First operand has 311 places, 471 transitions, 8502 flow. Second operand 9 states and 176 transitions.
[2024-06-20 20:09:28,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 536 transitions, 10682 flow
[2024-06-20 20:09:30,213 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 536 transitions, 10495 flow, removed 58 selfloop flow, removed 7 redundant places.
[2024-06-20 20:09:30,220 INFO  L231             Difference]: Finished difference. Result has 316 places, 476 transitions, 8637 flow
[2024-06-20 20:09:30,221 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8315, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8637, PETRI_PLACES=316, PETRI_TRANSITIONS=476}
[2024-06-20 20:09:30,221 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places.
[2024-06-20 20:09:30,221 INFO  L495      AbstractCegarLoop]: Abstraction has has 316 places, 476 transitions, 8637 flow
[2024-06-20 20:09:30,221 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:30,221 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:30,221 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:30,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-20 20:09:30,222 INFO  L420      AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:30,222 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:30,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -247414500, now seen corresponding path program 4 times
[2024-06-20 20:09:30,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:30,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659595053]
[2024-06-20 20:09:30,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:30,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:30,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:36,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:36,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:36,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659595053]
[2024-06-20 20:09:36,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659595053] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:36,611 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:36,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:09:36,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398786185]
[2024-06-20 20:09:36,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:36,611 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:09:36,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:36,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:09:36,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:09:36,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:09:36,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 476 transitions, 8637 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:36,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:36,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:09:36,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:39,983 INFO  L124   PetriNetUnfolderBase]: 7143/11013 cut-off events.
[2024-06-20 20:09:39,983 INFO  L125   PetriNetUnfolderBase]: For 1521318/1521322 co-relation queries the response was YES.
[2024-06-20 20:09:40,096 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104184 conditions, 11013 events. 7143/11013 cut-off events. For 1521318/1521322 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 68658 event pairs, 2245 based on Foata normal form. 22/11034 useless extension candidates. Maximal degree in co-relation 104031. Up to 10635 conditions per place. 
[2024-06-20 20:09:40,141 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 457 selfloop transitions, 50 changer transitions 0/510 dead transitions.
[2024-06-20 20:09:40,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 510 transitions, 9885 flow
[2024-06-20 20:09:40,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:40,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:40,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 20:09:40,142 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 20:09:40,142 INFO  L175             Difference]: Start difference. First operand has 316 places, 476 transitions, 8637 flow. Second operand 9 states and 150 transitions.
[2024-06-20 20:09:40,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 510 transitions, 9885 flow
[2024-06-20 20:09:42,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 510 transitions, 9681 flow, removed 67 selfloop flow, removed 4 redundant places.
[2024-06-20 20:09:42,749 INFO  L231             Difference]: Finished difference. Result has 321 places, 478 transitions, 8685 flow
[2024-06-20 20:09:42,750 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8433, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8685, PETRI_PLACES=321, PETRI_TRANSITIONS=478}
[2024-06-20 20:09:42,750 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 280 predicate places.
[2024-06-20 20:09:42,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 478 transitions, 8685 flow
[2024-06-20 20:09:42,750 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:42,750 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:42,751 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:42,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-20 20:09:42,752 INFO  L420      AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:42,752 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:42,752 INFO  L85        PathProgramCache]: Analyzing trace with hash -247183860, now seen corresponding path program 5 times
[2024-06-20 20:09:42,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:42,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990232861]
[2024-06-20 20:09:42,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:42,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:42,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:48,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:48,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:48,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990232861]
[2024-06-20 20:09:48,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990232861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:48,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:48,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:09:48,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28300349]
[2024-06-20 20:09:48,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:48,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:09:48,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:48,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:09:48,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:09:49,108 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:09:49,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 478 transitions, 8685 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:49,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:49,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:09:49,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:53,257 INFO  L124   PetriNetUnfolderBase]: 7143/11013 cut-off events.
[2024-06-20 20:09:53,257 INFO  L125   PetriNetUnfolderBase]: For 1512169/1512173 co-relation queries the response was YES.
[2024-06-20 20:09:53,359 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102897 conditions, 11013 events. 7143/11013 cut-off events. For 1512169/1512173 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 68705 event pairs, 2218 based on Foata normal form. 22/11034 useless extension candidates. Maximal degree in co-relation 102743. Up to 10525 conditions per place. 
[2024-06-20 20:09:53,401 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 447 selfloop transitions, 60 changer transitions 0/510 dead transitions.
[2024-06-20 20:09:53,401 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 510 transitions, 9721 flow
[2024-06-20 20:09:53,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:53,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:53,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 20:09:53,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 20:09:53,402 INFO  L175             Difference]: Start difference. First operand has 321 places, 478 transitions, 8685 flow. Second operand 9 states and 150 transitions.
[2024-06-20 20:09:53,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 510 transitions, 9721 flow
[2024-06-20 20:09:55,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 510 transitions, 9485 flow, removed 71 selfloop flow, removed 7 redundant places.
[2024-06-20 20:09:55,649 INFO  L231             Difference]: Finished difference. Result has 322 places, 478 transitions, 8507 flow
[2024-06-20 20:09:55,649 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8335, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8507, PETRI_PLACES=322, PETRI_TRANSITIONS=478}
[2024-06-20 20:09:55,653 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places.
[2024-06-20 20:09:55,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 478 transitions, 8507 flow
[2024-06-20 20:09:55,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:55,654 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:55,654 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:55,654 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-20 20:09:55,654 INFO  L420      AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:55,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:55,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 419009077, now seen corresponding path program 5 times
[2024-06-20 20:09:55,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:55,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164904553]
[2024-06-20 20:09:55,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:55,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:55,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:01,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:01,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:01,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164904553]
[2024-06-20 20:10:01,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164904553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:01,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:01,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:10:01,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412332494]
[2024-06-20 20:10:01,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:01,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:10:01,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:01,822 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:10:01,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:10:01,952 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:10:01,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 478 transitions, 8507 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:01,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:01,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:10:01,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:05,523 INFO  L124   PetriNetUnfolderBase]: 7133/10998 cut-off events.
[2024-06-20 20:10:05,523 INFO  L125   PetriNetUnfolderBase]: For 1474410/1474414 co-relation queries the response was YES.
[2024-06-20 20:10:05,872 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102411 conditions, 10998 events. 7133/10998 cut-off events. For 1474410/1474414 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 68507 event pairs, 2312 based on Foata normal form. 5/11002 useless extension candidates. Maximal degree in co-relation 102256. Up to 10947 conditions per place. 
[2024-06-20 20:10:05,912 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 463 selfloop transitions, 25 changer transitions 0/491 dead transitions.
[2024-06-20 20:10:05,912 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 491 transitions, 9515 flow
[2024-06-20 20:10:05,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:10:05,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:10:05,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions.
[2024-06-20 20:10:05,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3625
[2024-06-20 20:10:05,914 INFO  L175             Difference]: Start difference. First operand has 322 places, 478 transitions, 8507 flow. Second operand 8 states and 116 transitions.
[2024-06-20 20:10:05,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 491 transitions, 9515 flow
[2024-06-20 20:10:08,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 491 transitions, 9240 flow, removed 68 selfloop flow, removed 8 redundant places.
[2024-06-20 20:10:08,402 INFO  L231             Difference]: Finished difference. Result has 322 places, 478 transitions, 8288 flow
[2024-06-20 20:10:08,402 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8232, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8288, PETRI_PLACES=322, PETRI_TRANSITIONS=478}
[2024-06-20 20:10:08,403 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places.
[2024-06-20 20:10:08,403 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 478 transitions, 8288 flow
[2024-06-20 20:10:08,403 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:08,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:08,406 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:10:08,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85
[2024-06-20 20:10:08,407 INFO  L420      AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:08,407 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:08,407 INFO  L85        PathProgramCache]: Analyzing trace with hash -772100473, now seen corresponding path program 6 times
[2024-06-20 20:10:08,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:08,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615688544]
[2024-06-20 20:10:08,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:08,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:08,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:14,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:14,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:14,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615688544]
[2024-06-20 20:10:14,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615688544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:14,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:14,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:10:14,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886237209]
[2024-06-20 20:10:14,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:14,904 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:10:14,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:14,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:10:14,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:10:15,035 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:10:15,036 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 478 transitions, 8288 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:15,036 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:15,036 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:10:15,036 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:18,287 INFO  L124   PetriNetUnfolderBase]: 7036/10839 cut-off events.
[2024-06-20 20:10:18,288 INFO  L125   PetriNetUnfolderBase]: For 1484842/1484844 co-relation queries the response was YES.
[2024-06-20 20:10:18,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100214 conditions, 10839 events. 7036/10839 cut-off events. For 1484842/1484844 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 67247 event pairs, 2282 based on Foata normal form. 4/10842 useless extension candidates. Maximal degree in co-relation 100059. Up to 10751 conditions per place. 
[2024-06-20 20:10:18,422 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 449 selfloop transitions, 36 changer transitions 0/488 dead transitions.
[2024-06-20 20:10:18,423 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 488 transitions, 9284 flow
[2024-06-20 20:10:18,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:10:18,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:10:18,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-20 20:10:18,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38571428571428573
[2024-06-20 20:10:18,424 INFO  L175             Difference]: Start difference. First operand has 322 places, 478 transitions, 8288 flow. Second operand 7 states and 108 transitions.
[2024-06-20 20:10:18,424 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 488 transitions, 9284 flow
[2024-06-20 20:10:20,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 488 transitions, 9172 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-06-20 20:10:20,993 INFO  L231             Difference]: Finished difference. Result has 320 places, 478 transitions, 8256 flow
[2024-06-20 20:10:20,994 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8176, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8256, PETRI_PLACES=320, PETRI_TRANSITIONS=478}
[2024-06-20 20:10:20,994 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places.
[2024-06-20 20:10:20,994 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 478 transitions, 8256 flow
[2024-06-20 20:10:20,994 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:20,994 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:20,995 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:10:20,995 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86
[2024-06-20 20:10:20,995 INFO  L420      AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:20,995 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:20,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -759205930, now seen corresponding path program 4 times
[2024-06-20 20:10:20,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:20,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840486697]
[2024-06-20 20:10:20,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:20,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:21,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:27,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:27,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:27,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840486697]
[2024-06-20 20:10:27,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840486697] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:27,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:27,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:10:27,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471266247]
[2024-06-20 20:10:27,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:27,113 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:10:27,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:27,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:10:27,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:10:27,221 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:10:27,221 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 478 transitions, 8256 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:27,221 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:27,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:10:27,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:30,479 INFO  L124   PetriNetUnfolderBase]: 7173/11030 cut-off events.
[2024-06-20 20:10:30,479 INFO  L125   PetriNetUnfolderBase]: For 1542729/1542731 co-relation queries the response was YES.
[2024-06-20 20:10:30,580 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102797 conditions, 11030 events. 7173/11030 cut-off events. For 1542729/1542731 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 68405 event pairs, 2285 based on Foata normal form. 8/11037 useless extension candidates. Maximal degree in co-relation 102642. Up to 10765 conditions per place. 
[2024-06-20 20:10:30,620 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 453 selfloop transitions, 63 changer transitions 0/519 dead transitions.
[2024-06-20 20:10:30,621 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 519 transitions, 10057 flow
[2024-06-20 20:10:30,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:10:30,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:10:30,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-20 20:10:30,622 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41875
[2024-06-20 20:10:30,622 INFO  L175             Difference]: Start difference. First operand has 320 places, 478 transitions, 8256 flow. Second operand 8 states and 134 transitions.
[2024-06-20 20:10:30,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 519 transitions, 10057 flow
[2024-06-20 20:10:33,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 519 transitions, 9922 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-20 20:10:33,294 INFO  L231             Difference]: Finished difference. Result has 322 places, 499 transitions, 8685 flow
[2024-06-20 20:10:33,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8125, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8685, PETRI_PLACES=322, PETRI_TRANSITIONS=499}
[2024-06-20 20:10:33,295 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places.
[2024-06-20 20:10:33,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 499 transitions, 8685 flow
[2024-06-20 20:10:33,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:33,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:33,295 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:10:33,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87
[2024-06-20 20:10:33,295 INFO  L420      AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:33,296 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:33,296 INFO  L85        PathProgramCache]: Analyzing trace with hash -758760057, now seen corresponding path program 1 times
[2024-06-20 20:10:33,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:33,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545023013]
[2024-06-20 20:10:33,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:33,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:33,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:40,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:40,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:40,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545023013]
[2024-06-20 20:10:40,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545023013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:40,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:40,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:40,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078828768]
[2024-06-20 20:10:40,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:40,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:40,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:40,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:40,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:40,493 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:10:40,494 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 499 transitions, 8685 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:40,494 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:40,494 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:10:40,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:44,136 INFO  L124   PetriNetUnfolderBase]: 7170/11024 cut-off events.
[2024-06-20 20:10:44,137 INFO  L125   PetriNetUnfolderBase]: For 1519410/1519410 co-relation queries the response was YES.
[2024-06-20 20:10:44,243 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104372 conditions, 11024 events. 7170/11024 cut-off events. For 1519410/1519410 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 68345 event pairs, 2232 based on Foata normal form. 1/11024 useless extension candidates. Maximal degree in co-relation 104214. Up to 10994 conditions per place. 
[2024-06-20 20:10:44,284 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 486 selfloop transitions, 20 changer transitions 0/509 dead transitions.
[2024-06-20 20:10:44,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 509 transitions, 9725 flow
[2024-06-20 20:10:44,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:10:44,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:10:44,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions.
[2024-06-20 20:10:44,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-20 20:10:44,285 INFO  L175             Difference]: Start difference. First operand has 322 places, 499 transitions, 8685 flow. Second operand 7 states and 100 transitions.
[2024-06-20 20:10:44,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 509 transitions, 9725 flow
[2024-06-20 20:10:46,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 509 transitions, 9569 flow, removed 66 selfloop flow, removed 2 redundant places.
[2024-06-20 20:10:46,691 INFO  L231             Difference]: Finished difference. Result has 327 places, 499 transitions, 8581 flow
[2024-06-20 20:10:46,691 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8531, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8581, PETRI_PLACES=327, PETRI_TRANSITIONS=499}
[2024-06-20 20:10:46,691 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places.
[2024-06-20 20:10:46,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 499 transitions, 8581 flow
[2024-06-20 20:10:46,692 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:46,692 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:46,692 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:10:46,692 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88
[2024-06-20 20:10:46,692 INFO  L420      AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:46,692 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:46,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 1402776422, now seen corresponding path program 5 times
[2024-06-20 20:10:46,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:46,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398301842]
[2024-06-20 20:10:46,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:46,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:46,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat