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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe021_power.opt_pso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:51:13,886 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:51:13,963 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:51:13,968 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:51:13,969 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:51:13,996 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:51:13,997 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:51:13,998 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:51:13,998 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:51:14,002 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:51:14,003 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:51:14,003 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:51:14,004 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:51:14,005 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:51:14,005 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:51:14,006 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:51:14,006 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:51:14,006 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:51:14,007 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:51:14,007 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:51:14,008 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:51:14,009 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:51:14,009 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:51:14,009 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:51:14,009 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:51:14,009 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:51:14,009 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:51:14,010 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:51:14,010 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:51:14,010 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:51:14,010 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:51:14,010 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:51:14,011 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:51:14,011 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:51:14,011 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:51:14,011 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:51:14,011 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:51:14,011 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:51:14,012 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:51:14,012 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:51:14,012 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:51:14,012 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:51:14,013 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:51:14,013 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:51:14,267 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:51:14,312 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:51:14,314 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:51:14,315 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:51:14,316 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:51:14,317 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i
[2024-06-20 19:51:15,431 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:51:15,666 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:51:15,674 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i
[2024-06-20 19:51:15,688 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e7a3c02/69524d563ac84560bae132f737c062d7/FLAG46307e1e7
[2024-06-20 19:51:15,702 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e7a3c02/69524d563ac84560bae132f737c062d7
[2024-06-20 19:51:15,704 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:51:15,704 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:51:15,705 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/safe021_power.opt_pso.opt.yml/witness.yml
[2024-06-20 19:51:15,974 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:51:15,975 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:51:15,976 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:51:15,977 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:51:15,981 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:51:15,981 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:51:15" (1/2) ...
[2024-06-20 19:51:15,982 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48eb71fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:51:15, skipping insertion in model container
[2024-06-20 19:51:15,982 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:51:15" (1/2) ...
[2024-06-20 19:51:15,984 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4770ff99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:51:15, skipping insertion in model container
[2024-06-20 19:51:15,984 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:51:15" (2/2) ...
[2024-06-20 19:51:15,985 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48eb71fc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:15, skipping insertion in model container
[2024-06-20 19:51:15,985 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:51:15" (2/2) ...
[2024-06-20 19:51:15,985 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:51:16,074 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:51:16,075 INFO  L97    edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-06-20 19:51:16,076 INFO  L97    edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-06-20 19:51:16,077 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-06-20 19:51:16,077 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:51:16,078 INFO  L106   edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1;
[2024-06-20 19:51:16,124 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:51:16,476 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:51:16,486 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:51:16,945 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:51:16,981 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:51:16,982 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16 WrapperNode
[2024-06-20 19:51:16,982 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:51:16,983 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:51:16,983 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:51:16,983 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:51:16,989 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,045 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,176 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144
[2024-06-20 19:51:17,176 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:51:17,178 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:51:17,178 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:51:17,178 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:51:17,188 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,189 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,223 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,266 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:51:17,267 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,267 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,308 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,310 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,324 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,331 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,351 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:51:17,352 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:51:17,353 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:51:17,353 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:51:17,354 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (1/1) ...
[2024-06-20 19:51:17,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:51:17,370 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:51:17,389 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:51:17,416 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:51:17,432 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:51:17,432 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:51:17,432 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:51:17,432 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:51:17,432 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:51:17,432 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:51:17,433 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:51:17,433 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:51:17,433 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:51:17,433 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:51:17,434 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:51:17,434 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:51:17,436 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:51:17,591 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:51:17,593 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:51:19,157 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:51:19,159 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:51:19,527 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:51:19,527 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:51:19,528 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:51:19 BoogieIcfgContainer
[2024-06-20 19:51:19,528 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:51:19,531 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:51:19,532 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:51:19,534 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:51:19,535 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:51:15" (1/4) ...
[2024-06-20 19:51:19,536 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f999304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:51:19, skipping insertion in model container
[2024-06-20 19:51:19,536 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:51:15" (2/4) ...
[2024-06-20 19:51:19,536 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f999304 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:51:19, skipping insertion in model container
[2024-06-20 19:51:19,536 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:51:16" (3/4) ...
[2024-06-20 19:51:19,537 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f999304 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:51:19, skipping insertion in model container
[2024-06-20 19:51:19,537 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:51:19" (4/4) ...
[2024-06-20 19:51:19,540 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i
[2024-06-20 19:51:19,556 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:51:19,557 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:51:19,557 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:51:19,682 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:51:19,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:51:19,785 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-20 19:51:19,785 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:51:19,788 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 64 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:51:19,788 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:51:19,791 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-20 19:51:19,799 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:51:19,804 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;@683eaf63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:51:19,805 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:51:19,812 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:51:19,813 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:51:19,813 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:51:19,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:19,814 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:51:19,814 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:51:19,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:19,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 372110564, now seen corresponding path program 1 times
[2024-06-20 19:51:19,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:19,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679317458]
[2024-06-20 19:51:19,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:19,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:20,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:27,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:27,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:27,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679317458]
[2024-06-20 19:51:27,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679317458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:27,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:27,454 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:51:27,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593055893]
[2024-06-20 19:51:27,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:27,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:51:27,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:27,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:51:27,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:51:27,610 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40
[2024-06-20 19:51:27,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:27,613 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:27,613 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40
[2024-06-20 19:51:27,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:28,654 INFO  L124   PetriNetUnfolderBase]: 1152/1755 cut-off events.
[2024-06-20 19:51:28,654 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-06-20 19:51:28,662 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1755 events. 1152/1755 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8178 event pairs, 794 based on Foata normal form. 2/1710 useless extension candidates. Maximal degree in co-relation 3583. Up to 1738 conditions per place. 
[2024-06-20 19:51:28,673 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-20 19:51:28,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 171 flow
[2024-06-20 19:51:28,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:51:28,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:51:28,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2024-06-20 19:51:28,685 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-20 19:51:28,686 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 72 transitions.
[2024-06-20 19:51:28,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 171 flow
[2024-06-20 19:51:28,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:51:28,692 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-20 19:51:28,694 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:51:28,697 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-20 19:51:28,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-20 19:51:28,698 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:28,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:28,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:28,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:51:28,698 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:51:28,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:28,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1117077401, now seen corresponding path program 1 times
[2024-06-20 19:51:28,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:28,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761145768]
[2024-06-20 19:51:28,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:28,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:28,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:33,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:33,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:33,848 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761145768]
[2024-06-20 19:51:33,848 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761145768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:33,848 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:33,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:51:33,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068520599]
[2024-06-20 19:51:33,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:33,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:51:33,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:33,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:51:33,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:51:33,965 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:51:33,965 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:33,965 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:33,965 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:51:33,965 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:35,127 INFO  L124   PetriNetUnfolderBase]: 1395/2101 cut-off events.
[2024-06-20 19:51:35,128 INFO  L125   PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES.
[2024-06-20 19:51:35,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4853 conditions, 2101 events. 1395/2101 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9517 event pairs, 862 based on Foata normal form. 3/2102 useless extension candidates. Maximal degree in co-relation 4841. Up to 2073 conditions per place. 
[2024-06-20 19:51:35,142 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 42 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-20 19:51:35,142 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 252 flow
[2024-06-20 19:51:35,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:51:35,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:51:35,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions.
[2024-06-20 19:51:35,146 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.55625
[2024-06-20 19:51:35,146 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 89 transitions.
[2024-06-20 19:51:35,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 252 flow
[2024-06-20 19:51:35,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:51:35,151 INFO  L231             Difference]: Finished difference. Result has 45 places, 40 transitions, 150 flow
[2024-06-20 19:51:35,151 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=40}
[2024-06-20 19:51:35,152 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2024-06-20 19:51:35,152 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 150 flow
[2024-06-20 19:51:35,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:35,153 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:35,154 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:35,156 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:51:35,156 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:51:35,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:35,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 269662507, now seen corresponding path program 1 times
[2024-06-20 19:51:35,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:35,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315866633]
[2024-06-20 19:51:35,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:35,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:35,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:39,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:39,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:39,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315866633]
[2024-06-20 19:51:39,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315866633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:39,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:39,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:51:39,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28987230]
[2024-06-20 19:51:39,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:39,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:51:39,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:39,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:51:39,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:51:39,920 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:51:39,921 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 150 flow. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:39,921 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:39,921 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:51:39,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:41,000 INFO  L124   PetriNetUnfolderBase]: 1383/2083 cut-off events.
[2024-06-20 19:51:41,001 INFO  L125   PetriNetUnfolderBase]: For 1050/1058 co-relation queries the response was YES.
[2024-06-20 19:51:41,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 2083 events. 1383/2083 cut-off events. For 1050/1058 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9484 event pairs, 612 based on Foata normal form. 12/2093 useless extension candidates. Maximal degree in co-relation 5345. Up to 2025 conditions per place. 
[2024-06-20 19:51:41,016 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 50 selfloop transitions, 10 changer transitions 0/65 dead transitions.
[2024-06-20 19:51:41,016 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 338 flow
[2024-06-20 19:51:41,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:51:41,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:51:41,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions.
[2024-06-20 19:51:41,022 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.55
[2024-06-20 19:51:41,022 INFO  L175             Difference]: Start difference. First operand has 45 places, 40 transitions, 150 flow. Second operand 5 states and 110 transitions.
[2024-06-20 19:51:41,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 338 flow
[2024-06-20 19:51:41,025 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 336 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-20 19:51:41,027 INFO  L231             Difference]: Finished difference. Result has 50 places, 43 transitions, 196 flow
[2024-06-20 19:51:41,027 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=43}
[2024-06-20 19:51:41,029 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places.
[2024-06-20 19:51:41,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 196 flow
[2024-06-20 19:51:41,029 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:41,029 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:41,029 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:41,030 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:51:41,030 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:51:41,031 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:41,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -265907840, now seen corresponding path program 1 times
[2024-06-20 19:51:41,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:41,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998095513]
[2024-06-20 19:51:41,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:41,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:41,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:46,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:46,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:46,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998095513]
[2024-06-20 19:51:46,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998095513] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:46,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:46,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:51:46,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580164754]
[2024-06-20 19:51:46,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:46,805 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:51:46,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:46,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:51:46,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:51:46,940 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:51:46,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 196 flow. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:51:46,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:46,941 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:51:46,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:48,107 INFO  L124   PetriNetUnfolderBase]: 1374/2068 cut-off events.
[2024-06-20 19:51:48,107 INFO  L125   PetriNetUnfolderBase]: For 1915/1923 co-relation queries the response was YES.
[2024-06-20 19:51:48,111 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5859 conditions, 2068 events. 1374/2068 cut-off events. For 1915/1923 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9324 event pairs, 472 based on Foata normal form. 12/2078 useless extension candidates. Maximal degree in co-relation 5841. Up to 1980 conditions per place. 
[2024-06-20 19:51:48,120 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 54 selfloop transitions, 12 changer transitions 0/71 dead transitions.
[2024-06-20 19:51:48,120 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 402 flow
[2024-06-20 19:51:48,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:51:48,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:51:48,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions.
[2024-06-20 19:51:48,124 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.525
[2024-06-20 19:51:48,125 INFO  L175             Difference]: Start difference. First operand has 50 places, 43 transitions, 196 flow. Second operand 6 states and 126 transitions.
[2024-06-20 19:51:48,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 402 flow
[2024-06-20 19:51:48,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 380 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-20 19:51:48,133 INFO  L231             Difference]: Finished difference. Result has 52 places, 44 transitions, 215 flow
[2024-06-20 19:51:48,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=44}
[2024-06-20 19:51:48,134 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places.
[2024-06-20 19:51:48,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 215 flow
[2024-06-20 19:51:48,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:51:48,135 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:48,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:48,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:51:48,136 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:48,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:48,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195026544, now seen corresponding path program 1 times
[2024-06-20 19:51:48,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:48,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297880059]
[2024-06-20 19:51:48,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:48,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:48,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:55,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:55,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:55,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297880059]
[2024-06-20 19:51:55,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297880059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:55,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:55,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:51:55,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764444511]
[2024-06-20 19:51:55,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:55,527 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:51:55,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:55,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:51:55,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:51:55,666 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:51:55,667 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 215 flow. Second operand  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:55,667 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:55,667 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:51:55,667 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:56,767 INFO  L124   PetriNetUnfolderBase]: 1237/1890 cut-off events.
[2024-06-20 19:51:56,767 INFO  L125   PetriNetUnfolderBase]: For 2911/2935 co-relation queries the response was YES.
[2024-06-20 19:51:56,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 1890 events. 1237/1890 cut-off events. For 2911/2935 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8707 event pairs, 586 based on Foata normal form. 4/1825 useless extension candidates. Maximal degree in co-relation 5628. Up to 1810 conditions per place. 
[2024-06-20 19:51:56,780 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 41 selfloop transitions, 10 changer transitions 0/60 dead transitions.
[2024-06-20 19:51:56,780 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 359 flow
[2024-06-20 19:51:56,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:51:56,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:51:56,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-06-20 19:51:56,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455
[2024-06-20 19:51:56,782 INFO  L175             Difference]: Start difference. First operand has 52 places, 44 transitions, 215 flow. Second operand 5 states and 91 transitions.
[2024-06-20 19:51:56,783 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 359 flow
[2024-06-20 19:51:56,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 328 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-20 19:51:56,793 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 229 flow
[2024-06-20 19:51:56,793 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-20 19:51:56,795 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places.
[2024-06-20 19:51:56,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 229 flow
[2024-06-20 19:51:56,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:56,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:56,797 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:56,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:51:56,798 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:51:56,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:56,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1608883590, now seen corresponding path program 1 times
[2024-06-20 19:51:56,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:56,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431981297]
[2024-06-20 19:51:56,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:56,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:56,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:04,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:04,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:04,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431981297]
[2024-06-20 19:52:04,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431981297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:04,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:04,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:52:04,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621668460]
[2024-06-20 19:52:04,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:04,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:52:04,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:04,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:52:04,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:52:05,111 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:05,112 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 229 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:05,112 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:05,112 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:05,112 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:06,117 INFO  L124   PetriNetUnfolderBase]: 1468/2236 cut-off events.
[2024-06-20 19:52:06,118 INFO  L125   PetriNetUnfolderBase]: For 4395/4415 co-relation queries the response was YES.
[2024-06-20 19:52:06,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7064 conditions, 2236 events. 1468/2236 cut-off events. For 4395/4415 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10530 event pairs, 721 based on Foata normal form. 2/2203 useless extension candidates. Maximal degree in co-relation 7042. Up to 2137 conditions per place. 
[2024-06-20 19:52:06,131 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 52 selfloop transitions, 11 changer transitions 0/71 dead transitions.
[2024-06-20 19:52:06,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 439 flow
[2024-06-20 19:52:06,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:52:06,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:52:06,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-20 19:52:06,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:52:06,133 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 229 flow. Second operand 6 states and 100 transitions.
[2024-06-20 19:52:06,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 439 flow
[2024-06-20 19:52:06,135 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 413 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-20 19:52:06,136 INFO  L231             Difference]: Finished difference. Result has 58 places, 56 transitions, 301 flow
[2024-06-20 19:52:06,136 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=58, PETRI_TRANSITIONS=56}
[2024-06-20 19:52:06,137 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places.
[2024-06-20 19:52:06,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 301 flow
[2024-06-20 19:52:06,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:06,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:06,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:06,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:52:06,138 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:52:06,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:06,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -1669937297, now seen corresponding path program 1 times
[2024-06-20 19:52:06,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:06,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095137322]
[2024-06-20 19:52:06,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:06,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:06,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:12,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:12,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:12,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095137322]
[2024-06-20 19:52:12,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095137322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:12,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:12,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:52:12,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626867640]
[2024-06-20 19:52:12,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:12,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:52:12,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:12,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:52:12,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:52:13,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:13,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 301 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:13,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:13,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:13,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:14,204 INFO  L124   PetriNetUnfolderBase]: 1522/2289 cut-off events.
[2024-06-20 19:52:14,205 INFO  L125   PetriNetUnfolderBase]: For 5674/5704 co-relation queries the response was YES.
[2024-06-20 19:52:14,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 2289 events. 1522/2289 cut-off events. For 5674/5704 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10384 event pairs, 699 based on Foata normal form. 14/2293 useless extension candidates. Maximal degree in co-relation 7909. Up to 2240 conditions per place. 
[2024-06-20 19:52:14,220 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 57 selfloop transitions, 13 changer transitions 0/77 dead transitions.
[2024-06-20 19:52:14,220 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 503 flow
[2024-06-20 19:52:14,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:52:14,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:52:14,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-20 19:52:14,221 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42916666666666664
[2024-06-20 19:52:14,221 INFO  L175             Difference]: Start difference. First operand has 58 places, 56 transitions, 301 flow. Second operand 6 states and 103 transitions.
[2024-06-20 19:52:14,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 503 flow
[2024-06-20 19:52:14,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 497 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-20 19:52:14,228 INFO  L231             Difference]: Finished difference. Result has 63 places, 59 transitions, 351 flow
[2024-06-20 19:52:14,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=63, PETRI_TRANSITIONS=59}
[2024-06-20 19:52:14,229 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places.
[2024-06-20 19:52:14,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 351 flow
[2024-06-20 19:52:14,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:14,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:14,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:14,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:52:14,230 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:52:14,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:14,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664223377, now seen corresponding path program 2 times
[2024-06-20 19:52:14,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:14,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257613359]
[2024-06-20 19:52:14,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:14,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:14,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:20,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:20,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:20,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257613359]
[2024-06-20 19:52:20,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257613359] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:20,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:20,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:52:20,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993033960]
[2024-06-20 19:52:20,892 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:20,892 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:52:20,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:20,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:52:20,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:52:21,049 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:21,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 351 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:21,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:21,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:21,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:21,916 INFO  L124   PetriNetUnfolderBase]: 1546/2326 cut-off events.
[2024-06-20 19:52:21,917 INFO  L125   PetriNetUnfolderBase]: For 7667/7706 co-relation queries the response was YES.
[2024-06-20 19:52:21,921 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8729 conditions, 2326 events. 1546/2326 cut-off events. For 7667/7706 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10566 event pairs, 696 based on Foata normal form. 11/2326 useless extension candidates. Maximal degree in co-relation 8701. Up to 2253 conditions per place. 
[2024-06-20 19:52:21,927 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 54 selfloop transitions, 21 changer transitions 0/82 dead transitions.
[2024-06-20 19:52:21,928 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 605 flow
[2024-06-20 19:52:21,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:52:21,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:52:21,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-20 19:52:21,929 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:52:21,929 INFO  L175             Difference]: Start difference. First operand has 63 places, 59 transitions, 351 flow. Second operand 7 states and 112 transitions.
[2024-06-20 19:52:21,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 605 flow
[2024-06-20 19:52:21,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 569 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-20 19:52:21,934 INFO  L231             Difference]: Finished difference. Result has 68 places, 67 transitions, 449 flow
[2024-06-20 19:52:21,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=68, PETRI_TRANSITIONS=67}
[2024-06-20 19:52:21,935 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places.
[2024-06-20 19:52:21,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 449 flow
[2024-06-20 19:52:21,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:21,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:21,936 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:21,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:52:21,936 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:52:21,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:21,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664215441, now seen corresponding path program 1 times
[2024-06-20 19:52:21,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:21,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768642223]
[2024-06-20 19:52:21,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:21,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:22,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:29,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:29,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:29,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768642223]
[2024-06-20 19:52:29,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768642223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:29,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:29,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:52:29,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591556969]
[2024-06-20 19:52:29,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:29,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:52:29,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:29,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:52:29,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:52:29,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:29,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 449 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:29,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:29,381 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:29,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:30,324 INFO  L124   PetriNetUnfolderBase]: 1565/2364 cut-off events.
[2024-06-20 19:52:30,325 INFO  L125   PetriNetUnfolderBase]: For 11040/11125 co-relation queries the response was YES.
[2024-06-20 19:52:30,328 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9246 conditions, 2364 events. 1565/2364 cut-off events. For 11040/11125 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11169 event pairs, 962 based on Foata normal form. 2/2302 useless extension candidates. Maximal degree in co-relation 9215. Up to 2256 conditions per place. 
[2024-06-20 19:52:30,334 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 63 selfloop transitions, 16 changer transitions 0/90 dead transitions.
[2024-06-20 19:52:30,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 683 flow
[2024-06-20 19:52:30,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:52:30,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:52:30,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-20 19:52:30,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:52:30,336 INFO  L175             Difference]: Start difference. First operand has 68 places, 67 transitions, 449 flow. Second operand 8 states and 124 transitions.
[2024-06-20 19:52:30,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 683 flow
[2024-06-20 19:52:30,340 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 645 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-20 19:52:30,341 INFO  L231             Difference]: Finished difference. Result has 75 places, 72 transitions, 492 flow
[2024-06-20 19:52:30,341 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=492, PETRI_PLACES=75, PETRI_TRANSITIONS=72}
[2024-06-20 19:52:30,342 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places.
[2024-06-20 19:52:30,342 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 492 flow
[2024-06-20 19:52:30,342 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:30,342 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:30,343 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:30,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:52:30,343 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:52:30,343 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:30,343 INFO  L85        PathProgramCache]: Analyzing trace with hash 1538959925, now seen corresponding path program 1 times
[2024-06-20 19:52:30,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:30,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641974144]
[2024-06-20 19:52:30,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:30,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:30,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:37,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:37,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:37,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641974144]
[2024-06-20 19:52:37,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641974144] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:37,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:37,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:52:37,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056630901]
[2024-06-20 19:52:37,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:37,932 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:52:37,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:37,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:52:37,933 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:52:38,037 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:38,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 492 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:38,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:38,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:38,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:38,980 INFO  L124   PetriNetUnfolderBase]: 1559/2359 cut-off events.
[2024-06-20 19:52:38,980 INFO  L125   PetriNetUnfolderBase]: For 13025/13114 co-relation queries the response was YES.
[2024-06-20 19:52:38,985 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9827 conditions, 2359 events. 1559/2359 cut-off events. For 13025/13114 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11052 event pairs, 590 based on Foata normal form. 28/2333 useless extension candidates. Maximal degree in co-relation 9793. Up to 2211 conditions per place. 
[2024-06-20 19:52:38,992 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 77 selfloop transitions, 26 changer transitions 0/111 dead transitions.
[2024-06-20 19:52:38,993 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 111 transitions, 822 flow
[2024-06-20 19:52:38,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:52:38,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:52:38,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 19:52:38,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.434375
[2024-06-20 19:52:38,996 INFO  L175             Difference]: Start difference. First operand has 75 places, 72 transitions, 492 flow. Second operand 8 states and 139 transitions.
[2024-06-20 19:52:38,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 111 transitions, 822 flow
[2024-06-20 19:52:39,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 788 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 19:52:39,005 INFO  L231             Difference]: Finished difference. Result has 80 places, 83 transitions, 592 flow
[2024-06-20 19:52:39,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=592, PETRI_PLACES=80, PETRI_TRANSITIONS=83}
[2024-06-20 19:52:39,006 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-20 19:52:39,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 592 flow
[2024-06-20 19:52:39,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:39,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:39,006 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:39,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:52:39,007 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:52:39,007 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:39,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458796319, now seen corresponding path program 2 times
[2024-06-20 19:52:39,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:39,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111257687]
[2024-06-20 19:52:39,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:39,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:39,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:46,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:46,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:46,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111257687]
[2024-06-20 19:52:46,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111257687] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:46,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:46,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:52:46,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091301937]
[2024-06-20 19:52:46,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:46,555 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:52:46,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:46,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:52:46,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:52:46,699 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:46,700 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 592 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:46,700 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:46,700 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:46,700 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:47,758 INFO  L124   PetriNetUnfolderBase]: 1629/2462 cut-off events.
[2024-06-20 19:52:47,758 INFO  L125   PetriNetUnfolderBase]: For 16607/16742 co-relation queries the response was YES.
[2024-06-20 19:52:47,763 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11208 conditions, 2462 events. 1629/2462 cut-off events. For 16607/16742 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11514 event pairs, 554 based on Foata normal form. 42/2449 useless extension candidates. Maximal degree in co-relation 11171. Up to 2272 conditions per place. 
[2024-06-20 19:52:47,772 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 81 selfloop transitions, 40 changer transitions 0/129 dead transitions.
[2024-06-20 19:52:47,773 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 129 transitions, 1076 flow
[2024-06-20 19:52:47,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:52:47,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:52:47,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:52:47,776 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:52:47,776 INFO  L175             Difference]: Start difference. First operand has 80 places, 83 transitions, 592 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:52:47,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 129 transitions, 1076 flow
[2024-06-20 19:52:47,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 129 transitions, 1007 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:52:47,789 INFO  L231             Difference]: Finished difference. Result has 88 places, 104 transitions, 840 flow
[2024-06-20 19:52:47,789 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=840, PETRI_PLACES=88, PETRI_TRANSITIONS=104}
[2024-06-20 19:52:47,790 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places.
[2024-06-20 19:52:47,790 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 840 flow
[2024-06-20 19:52:47,790 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:47,790 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:47,791 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:47,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:52:47,791 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:52:47,791 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:47,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458916289, now seen corresponding path program 3 times
[2024-06-20 19:52:47,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:47,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677179925]
[2024-06-20 19:52:47,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:47,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:47,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:55,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:55,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:55,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677179925]
[2024-06-20 19:52:55,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677179925] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:55,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:55,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:52:55,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869124324]
[2024-06-20 19:52:55,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:55,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:52:55,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:55,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:52:55,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:52:55,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:55,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 840 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:55,306 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:55,306 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:55,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:56,705 INFO  L124   PetriNetUnfolderBase]: 1679/2538 cut-off events.
[2024-06-20 19:52:56,705 INFO  L125   PetriNetUnfolderBase]: For 21051/21183 co-relation queries the response was YES.
[2024-06-20 19:52:56,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12334 conditions, 2538 events. 1679/2538 cut-off events. For 21051/21183 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11889 event pairs, 544 based on Foata normal form. 59/2541 useless extension candidates. Maximal degree in co-relation 12293. Up to 2287 conditions per place. 
[2024-06-20 19:52:56,720 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 84 selfloop transitions, 49 changer transitions 0/141 dead transitions.
[2024-06-20 19:52:56,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 1335 flow
[2024-06-20 19:52:56,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:52:56,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:52:56,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 19:52:56,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.446875
[2024-06-20 19:52:56,723 INFO  L175             Difference]: Start difference. First operand has 88 places, 104 transitions, 840 flow. Second operand 8 states and 143 transitions.
[2024-06-20 19:52:56,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 1335 flow
[2024-06-20 19:52:56,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 141 transitions, 1279 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:52:56,740 INFO  L231             Difference]: Finished difference. Result has 93 places, 113 transitions, 1011 flow
[2024-06-20 19:52:56,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1011, PETRI_PLACES=93, PETRI_TRANSITIONS=113}
[2024-06-20 19:52:56,741 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places.
[2024-06-20 19:52:56,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 113 transitions, 1011 flow
[2024-06-20 19:52:56,742 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:56,742 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:56,742 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:56,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:52:56,742 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:52:56,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:56,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458916475, now seen corresponding path program 1 times
[2024-06-20 19:52:56,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:56,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208338887]
[2024-06-20 19:52:56,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:56,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:56,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:04,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:04,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:04,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208338887]
[2024-06-20 19:53:04,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208338887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:04,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:04,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:04,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108806061]
[2024-06-20 19:53:04,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:04,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:04,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:04,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:04,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:04,820 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:04,820 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 113 transitions, 1011 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:53:04,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:04,821 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:04,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:05,852 INFO  L124   PetriNetUnfolderBase]: 1844/2760 cut-off events.
[2024-06-20 19:53:05,852 INFO  L125   PetriNetUnfolderBase]: For 23610/23610 co-relation queries the response was YES.
[2024-06-20 19:53:05,858 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13795 conditions, 2760 events. 1844/2760 cut-off events. For 23610/23610 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12846 event pairs, 821 based on Foata normal form. 2/2761 useless extension candidates. Maximal degree in co-relation 13753. Up to 2695 conditions per place. 
[2024-06-20 19:53:05,868 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 126 selfloop transitions, 21 changer transitions 0/150 dead transitions.
[2024-06-20 19:53:05,868 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 150 transitions, 1509 flow
[2024-06-20 19:53:05,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:53:05,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:53:05,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-20 19:53:05,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.396875
[2024-06-20 19:53:05,872 INFO  L175             Difference]: Start difference. First operand has 93 places, 113 transitions, 1011 flow. Second operand 8 states and 127 transitions.
[2024-06-20 19:53:05,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 150 transitions, 1509 flow
[2024-06-20 19:53:05,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 150 transitions, 1437 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-20 19:53:05,895 INFO  L231             Difference]: Finished difference. Result has 100 places, 126 transitions, 1150 flow
[2024-06-20 19:53:05,895 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1150, PETRI_PLACES=100, PETRI_TRANSITIONS=126}
[2024-06-20 19:53:05,896 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places.
[2024-06-20 19:53:05,896 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 126 transitions, 1150 flow
[2024-06-20 19:53:05,896 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:53:05,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:05,896 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:05,897 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:53:05,897 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:05,897 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:05,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -228568021, now seen corresponding path program 4 times
[2024-06-20 19:53:05,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:05,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563913573]
[2024-06-20 19:53:05,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:05,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:05,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:12,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:12,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:12,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563913573]
[2024-06-20 19:53:12,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563913573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:12,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:12,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:12,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333948066]
[2024-06-20 19:53:12,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:12,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:12,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:12,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:12,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:12,486 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:53:12,486 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 126 transitions, 1150 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:12,486 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:12,486 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:53:12,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:13,737 INFO  L124   PetriNetUnfolderBase]: 1696/2571 cut-off events.
[2024-06-20 19:53:13,737 INFO  L125   PetriNetUnfolderBase]: For 28949/29080 co-relation queries the response was YES.
[2024-06-20 19:53:13,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13777 conditions, 2571 events. 1696/2571 cut-off events. For 28949/29080 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12095 event pairs, 566 based on Foata normal form. 54/2568 useless extension candidates. Maximal degree in co-relation 13730. Up to 2324 conditions per place. 
[2024-06-20 19:53:13,751 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 91 selfloop transitions, 49 changer transitions 0/152 dead transitions.
[2024-06-20 19:53:13,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 152 transitions, 1550 flow
[2024-06-20 19:53:13,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:13,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:13,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 19:53:13,755 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392857142857143
[2024-06-20 19:53:13,755 INFO  L175             Difference]: Start difference. First operand has 100 places, 126 transitions, 1150 flow. Second operand 7 states and 123 transitions.
[2024-06-20 19:53:13,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 152 transitions, 1550 flow
[2024-06-20 19:53:13,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 152 transitions, 1515 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-20 19:53:13,783 INFO  L231             Difference]: Finished difference. Result has 105 places, 129 transitions, 1279 flow
[2024-06-20 19:53:13,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1279, PETRI_PLACES=105, PETRI_TRANSITIONS=129}
[2024-06-20 19:53:13,784 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places.
[2024-06-20 19:53:13,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1279 flow
[2024-06-20 19:53:13,784 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:13,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:13,784 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:13,785 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:53:13,785 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:53:13,785 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:13,785 INFO  L85        PathProgramCache]: Analyzing trace with hash -228448051, now seen corresponding path program 5 times
[2024-06-20 19:53:13,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:13,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974846401]
[2024-06-20 19:53:13,786 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:13,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:13,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:20,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:20,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:20,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974846401]
[2024-06-20 19:53:20,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974846401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:20,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:20,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:20,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030208770]
[2024-06-20 19:53:20,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:20,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:20,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:20,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:20,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:20,846 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:53:20,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 1279 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:20,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:20,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:53:20,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:22,071 INFO  L124   PetriNetUnfolderBase]: 1774/2682 cut-off events.
[2024-06-20 19:53:22,072 INFO  L125   PetriNetUnfolderBase]: For 35264/35400 co-relation queries the response was YES.
[2024-06-20 19:53:22,078 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15319 conditions, 2682 events. 1774/2682 cut-off events. For 35264/35400 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12567 event pairs, 538 based on Foata normal form. 64/2690 useless extension candidates. Maximal degree in co-relation 15270. Up to 2347 conditions per place. 
[2024-06-20 19:53:22,086 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 87 selfloop transitions, 60 changer transitions 0/159 dead transitions.
[2024-06-20 19:53:22,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 159 transitions, 1805 flow
[2024-06-20 19:53:22,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:22,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:22,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 19:53:22,089 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 19:53:22,089 INFO  L175             Difference]: Start difference. First operand has 105 places, 129 transitions, 1279 flow. Second operand 7 states and 125 transitions.
[2024-06-20 19:53:22,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 159 transitions, 1805 flow
[2024-06-20 19:53:22,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 159 transitions, 1707 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-20 19:53:22,117 INFO  L231             Difference]: Finished difference. Result has 107 places, 135 transitions, 1412 flow
[2024-06-20 19:53:22,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1412, PETRI_PLACES=107, PETRI_TRANSITIONS=135}
[2024-06-20 19:53:22,118 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places.
[2024-06-20 19:53:22,118 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 135 transitions, 1412 flow
[2024-06-20 19:53:22,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:22,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:22,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:22,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:53:22,119 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:53:22,119 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:22,120 INFO  L85        PathProgramCache]: Analyzing trace with hash -163446493, now seen corresponding path program 2 times
[2024-06-20 19:53:22,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:22,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939090394]
[2024-06-20 19:53:22,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:22,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:22,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:29,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:29,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:29,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939090394]
[2024-06-20 19:53:29,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939090394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:29,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:29,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:29,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136571924]
[2024-06-20 19:53:29,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:29,831 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:29,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:29,832 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:29,832 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:29,966 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:29,967 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 135 transitions, 1412 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:53:29,967 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:29,967 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:29,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:31,170 INFO  L124   PetriNetUnfolderBase]: 1943/2902 cut-off events.
[2024-06-20 19:53:31,171 INFO  L125   PetriNetUnfolderBase]: For 38113/38115 co-relation queries the response was YES.
[2024-06-20 19:53:31,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16745 conditions, 2902 events. 1943/2902 cut-off events. For 38113/38115 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13503 event pairs, 833 based on Foata normal form. 4/2905 useless extension candidates. Maximal degree in co-relation 16695. Up to 2819 conditions per place. 
[2024-06-20 19:53:31,186 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 133 selfloop transitions, 25 changer transitions 0/161 dead transitions.
[2024-06-20 19:53:31,186 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 161 transitions, 1851 flow
[2024-06-20 19:53:31,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:31,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:31,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-20 19:53:31,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:53:31,188 INFO  L175             Difference]: Start difference. First operand has 107 places, 135 transitions, 1412 flow. Second operand 7 states and 112 transitions.
[2024-06-20 19:53:31,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 161 transitions, 1851 flow
[2024-06-20 19:53:31,209 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 161 transitions, 1770 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-20 19:53:31,211 INFO  L231             Difference]: Finished difference. Result has 111 places, 141 transitions, 1466 flow
[2024-06-20 19:53:31,211 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1466, PETRI_PLACES=111, PETRI_TRANSITIONS=141}
[2024-06-20 19:53:31,211 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places.
[2024-06-20 19:53:31,212 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 141 transitions, 1466 flow
[2024-06-20 19:53:31,212 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:53:31,212 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:31,212 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:31,212 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:53:31,212 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:53:31,213 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:31,213 INFO  L85        PathProgramCache]: Analyzing trace with hash -51079195, now seen corresponding path program 3 times
[2024-06-20 19:53:31,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:31,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088649520]
[2024-06-20 19:53:31,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:31,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:31,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:39,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:39,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:39,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088649520]
[2024-06-20 19:53:39,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088649520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:39,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:39,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:39,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596614984]
[2024-06-20 19:53:39,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:39,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:39,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:39,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:39,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:39,582 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:39,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 141 transitions, 1466 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:53:39,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:39,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:39,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:40,670 INFO  L124   PetriNetUnfolderBase]: 1954/2921 cut-off events.
[2024-06-20 19:53:40,670 INFO  L125   PetriNetUnfolderBase]: For 36666/36670 co-relation queries the response was YES.
[2024-06-20 19:53:40,678 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16853 conditions, 2921 events. 1954/2921 cut-off events. For 36666/36670 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13625 event pairs, 836 based on Foata normal form. 6/2925 useless extension candidates. Maximal degree in co-relation 16801. Up to 2788 conditions per place. 
[2024-06-20 19:53:40,686 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 130 selfloop transitions, 37 changer transitions 0/170 dead transitions.
[2024-06-20 19:53:40,686 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 170 transitions, 2006 flow
[2024-06-20 19:53:40,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:40,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:40,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-20 19:53:40,688 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40714285714285714
[2024-06-20 19:53:40,688 INFO  L175             Difference]: Start difference. First operand has 111 places, 141 transitions, 1466 flow. Second operand 7 states and 114 transitions.
[2024-06-20 19:53:40,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 170 transitions, 2006 flow
[2024-06-20 19:53:40,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 170 transitions, 1946 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-20 19:53:40,711 INFO  L231             Difference]: Finished difference. Result has 116 places, 150 transitions, 1596 flow
[2024-06-20 19:53:40,711 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1596, PETRI_PLACES=116, PETRI_TRANSITIONS=150}
[2024-06-20 19:53:40,712 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places.
[2024-06-20 19:53:40,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 150 transitions, 1596 flow
[2024-06-20 19:53:40,712 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:53:40,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:40,712 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:40,712 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:53:40,713 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:53:40,713 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:40,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 1662270007, now seen corresponding path program 6 times
[2024-06-20 19:53:40,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:40,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137802361]
[2024-06-20 19:53:40,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:40,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:40,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:48,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:48,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:48,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137802361]
[2024-06-20 19:53:48,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137802361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:48,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:48,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:48,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240145441]
[2024-06-20 19:53:48,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:48,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:48,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:48,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:48,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:48,505 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:53:48,506 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 150 transitions, 1596 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:48,506 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:48,506 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:53:48,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:49,655 INFO  L124   PetriNetUnfolderBase]: 1804/2728 cut-off events.
[2024-06-20 19:53:49,655 INFO  L125   PetriNetUnfolderBase]: For 38513/38613 co-relation queries the response was YES.
[2024-06-20 19:53:49,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16153 conditions, 2728 events. 1804/2728 cut-off events. For 38513/38613 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12843 event pairs, 557 based on Foata normal form. 52/2715 useless extension candidates. Maximal degree in co-relation 16098. Up to 2324 conditions per place. 
[2024-06-20 19:53:49,671 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 90 selfloop transitions, 68 changer transitions 0/175 dead transitions.
[2024-06-20 19:53:49,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 175 transitions, 2096 flow
[2024-06-20 19:53:49,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:49,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:49,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 19:53:49,673 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-20 19:53:49,673 INFO  L175             Difference]: Start difference. First operand has 116 places, 150 transitions, 1596 flow. Second operand 7 states and 124 transitions.
[2024-06-20 19:53:49,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 175 transitions, 2096 flow
[2024-06-20 19:53:49,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 175 transitions, 2060 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-20 19:53:49,713 INFO  L231             Difference]: Finished difference. Result has 121 places, 153 transitions, 1757 flow
[2024-06-20 19:53:49,713 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1757, PETRI_PLACES=121, PETRI_TRANSITIONS=153}
[2024-06-20 19:53:49,714 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places.
[2024-06-20 19:53:49,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 153 transitions, 1757 flow
[2024-06-20 19:53:49,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:49,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:49,715 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:49,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:53:49,715 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:53:49,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:49,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -51316345, now seen corresponding path program 4 times
[2024-06-20 19:53:49,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:49,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194453]
[2024-06-20 19:53:49,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:49,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:49,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:57,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:57,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:57,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194453]
[2024-06-20 19:53:57,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:57,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:57,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:53:57,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504525342]
[2024-06-20 19:53:57,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:57,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:53:57,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:57,399 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:53:57,399 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:53:57,530 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:57,531 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 153 transitions, 1757 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:53:57,531 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:57,531 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:57,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:58,605 INFO  L124   PetriNetUnfolderBase]: 1933/2892 cut-off events.
[2024-06-20 19:53:58,605 INFO  L125   PetriNetUnfolderBase]: For 39967/39971 co-relation queries the response was YES.
[2024-06-20 19:53:58,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17313 conditions, 2892 events. 1933/2892 cut-off events. For 39967/39971 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13494 event pairs, 831 based on Foata normal form. 6/2896 useless extension candidates. Maximal degree in co-relation 17256. Up to 2761 conditions per place. 
[2024-06-20 19:53:58,623 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 133 selfloop transitions, 35 changer transitions 0/171 dead transitions.
[2024-06-20 19:53:58,623 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 171 transitions, 2155 flow
[2024-06-20 19:53:58,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:58,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:58,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:53:58,626 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:53:58,626 INFO  L175             Difference]: Start difference. First operand has 121 places, 153 transitions, 1757 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:53:58,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 171 transitions, 2155 flow
[2024-06-20 19:53:58,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 171 transitions, 1976 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 19:53:58,657 INFO  L231             Difference]: Finished difference. Result has 123 places, 153 transitions, 1656 flow
[2024-06-20 19:53:58,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1656, PETRI_PLACES=123, PETRI_TRANSITIONS=153}
[2024-06-20 19:53:58,658 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places.
[2024-06-20 19:53:58,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 153 transitions, 1656 flow
[2024-06-20 19:53:58,658 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:53:58,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:58,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:58,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:53:58,658 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:53:58,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:58,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -51070267, now seen corresponding path program 1 times
[2024-06-20 19:53:58,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:58,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581950931]
[2024-06-20 19:53:58,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:58,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:58,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:07,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:07,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:07,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581950931]
[2024-06-20 19:54:07,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581950931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:07,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:07,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:07,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534077990]
[2024-06-20 19:54:07,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:07,261 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:07,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:07,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:07,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:07,419 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:54:07,420 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 153 transitions, 1656 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:07,420 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:07,420 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:54:07,420 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:08,685 INFO  L124   PetriNetUnfolderBase]: 1878/2833 cut-off events.
[2024-06-20 19:54:08,685 INFO  L125   PetriNetUnfolderBase]: For 46375/46568 co-relation queries the response was YES.
[2024-06-20 19:54:08,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16922 conditions, 2833 events. 1878/2833 cut-off events. For 46375/46568 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13606 event pairs, 814 based on Foata normal form. 10/2782 useless extension candidates. Maximal degree in co-relation 16864. Up to 2665 conditions per place. 
[2024-06-20 19:54:08,702 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 134 selfloop transitions, 17 changer transitions 0/178 dead transitions.
[2024-06-20 19:54:08,703 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 178 transitions, 2052 flow
[2024-06-20 19:54:08,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:54:08,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:54:08,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions.
[2024-06-20 19:54:08,705 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40625
[2024-06-20 19:54:08,705 INFO  L175             Difference]: Start difference. First operand has 123 places, 153 transitions, 1656 flow. Second operand 8 states and 130 transitions.
[2024-06-20 19:54:08,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 178 transitions, 2052 flow
[2024-06-20 19:54:08,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 178 transitions, 1937 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-20 19:54:08,735 INFO  L231             Difference]: Finished difference. Result has 124 places, 155 transitions, 1602 flow
[2024-06-20 19:54:08,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1602, PETRI_PLACES=124, PETRI_TRANSITIONS=155}
[2024-06-20 19:54:08,736 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places.
[2024-06-20 19:54:08,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 155 transitions, 1602 flow
[2024-06-20 19:54:08,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:08,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:08,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:08,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:54:08,737 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:08,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:08,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 1785116638, now seen corresponding path program 1 times
[2024-06-20 19:54:08,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:08,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706670150]
[2024-06-20 19:54:08,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:08,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:08,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:17,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 19:54:17,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:17,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706670150]
[2024-06-20 19:54:17,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706670150] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:17,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:17,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:17,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763183561]
[2024-06-20 19:54:17,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:17,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:17,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:17,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:17,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:17,242 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:54:17,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 155 transitions, 1602 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:17,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:17,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:54:17,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:18,343 INFO  L124   PetriNetUnfolderBase]: 1790/2712 cut-off events.
[2024-06-20 19:54:18,344 INFO  L125   PetriNetUnfolderBase]: For 48598/48768 co-relation queries the response was YES.
[2024-06-20 19:54:18,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16601 conditions, 2712 events. 1790/2712 cut-off events. For 48598/48768 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12731 event pairs, 706 based on Foata normal form. 46/2710 useless extension candidates. Maximal degree in co-relation 16544. Up to 2461 conditions per place. 
[2024-06-20 19:54:18,363 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 120 selfloop transitions, 51 changer transitions 0/189 dead transitions.
[2024-06-20 19:54:18,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 189 transitions, 2121 flow
[2024-06-20 19:54:18,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:54:18,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:54:18,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:54:18,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:54:18,364 INFO  L175             Difference]: Start difference. First operand has 124 places, 155 transitions, 1602 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:54:18,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 189 transitions, 2121 flow
[2024-06-20 19:54:18,398 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 189 transitions, 2078 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-20 19:54:18,400 INFO  L231             Difference]: Finished difference. Result has 127 places, 162 transitions, 1791 flow
[2024-06-20 19:54:18,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1791, PETRI_PLACES=127, PETRI_TRANSITIONS=162}
[2024-06-20 19:54:18,401 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places.
[2024-06-20 19:54:18,401 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 162 transitions, 1791 flow
[2024-06-20 19:54:18,401 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:18,401 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:18,401 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:18,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:54:18,402 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:18,402 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:18,402 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376496025, now seen corresponding path program 1 times
[2024-06-20 19:54:18,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:18,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357992901]
[2024-06-20 19:54:18,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:18,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:18,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:26,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:26,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:26,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357992901]
[2024-06-20 19:54:26,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357992901] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:26,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:26,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:26,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852389669]
[2024-06-20 19:54:26,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:26,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:26,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:26,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:26,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:26,211 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:26,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 162 transitions, 1791 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:54:26,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:26,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:26,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:27,507 INFO  L124   PetriNetUnfolderBase]: 1980/2951 cut-off events.
[2024-06-20 19:54:27,508 INFO  L125   PetriNetUnfolderBase]: For 49532/49534 co-relation queries the response was YES.
[2024-06-20 19:54:27,516 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18222 conditions, 2951 events. 1980/2951 cut-off events. For 49532/49534 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13608 event pairs, 602 based on Foata normal form. 6/2956 useless extension candidates. Maximal degree in co-relation 18163. Up to 2780 conditions per place. 
[2024-06-20 19:54:27,526 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 175 selfloop transitions, 41 changer transitions 0/219 dead transitions.
[2024-06-20 19:54:27,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 219 transitions, 2653 flow
[2024-06-20 19:54:27,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:27,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:27,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:54:27,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:54:27,529 INFO  L175             Difference]: Start difference. First operand has 127 places, 162 transitions, 1791 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:54:27,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 219 transitions, 2653 flow
[2024-06-20 19:54:27,561 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 219 transitions, 2534 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:27,564 INFO  L231             Difference]: Finished difference. Result has 135 places, 187 transitions, 2159 flow
[2024-06-20 19:54:27,564 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2159, PETRI_PLACES=135, PETRI_TRANSITIONS=187}
[2024-06-20 19:54:27,565 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places.
[2024-06-20 19:54:27,565 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 187 transitions, 2159 flow
[2024-06-20 19:54:27,565 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:54:27,565 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:27,565 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:27,565 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:54:27,566 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:27,566 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:27,566 INFO  L85        PathProgramCache]: Analyzing trace with hash -962800912, now seen corresponding path program 2 times
[2024-06-20 19:54:27,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:27,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626343863]
[2024-06-20 19:54:27,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:27,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:27,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:35,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 19:54:35,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:35,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626343863]
[2024-06-20 19:54:35,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626343863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:35,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:35,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:35,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738497131]
[2024-06-20 19:54:35,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:35,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:35,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:35,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:35,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:35,540 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:54:35,541 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 187 transitions, 2159 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:35,541 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:35,541 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:54:35,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:36,755 INFO  L124   PetriNetUnfolderBase]: 1875/2830 cut-off events.
[2024-06-20 19:54:36,755 INFO  L125   PetriNetUnfolderBase]: For 59060/59154 co-relation queries the response was YES.
[2024-06-20 19:54:36,763 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18678 conditions, 2830 events. 1875/2830 cut-off events. For 59060/59154 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13352 event pairs, 519 based on Foata normal form. 27/2784 useless extension candidates. Maximal degree in co-relation 18614. Up to 2544 conditions per place. 
[2024-06-20 19:54:36,771 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 129 selfloop transitions, 68 changer transitions 0/220 dead transitions.
[2024-06-20 19:54:36,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 220 transitions, 2747 flow
[2024-06-20 19:54:36,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:54:36,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:54:36,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-20 19:54:36,772 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-20 19:54:36,772 INFO  L175             Difference]: Start difference. First operand has 135 places, 187 transitions, 2159 flow. Second operand 8 states and 141 transitions.
[2024-06-20 19:54:36,772 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 220 transitions, 2747 flow
[2024-06-20 19:54:36,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 220 transitions, 2684 flow, removed 28 selfloop flow, removed 2 redundant places.
[2024-06-20 19:54:36,813 INFO  L231             Difference]: Finished difference. Result has 141 places, 195 transitions, 2368 flow
[2024-06-20 19:54:36,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2368, PETRI_PLACES=141, PETRI_TRANSITIONS=195}
[2024-06-20 19:54:36,813 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places.
[2024-06-20 19:54:36,814 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 195 transitions, 2368 flow
[2024-06-20 19:54:36,814 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:36,814 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:36,814 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:36,814 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:54:36,814 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:36,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:36,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1359672173, now seen corresponding path program 2 times
[2024-06-20 19:54:36,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:36,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990691695]
[2024-06-20 19:54:36,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:36,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:36,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:44,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:44,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:44,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990691695]
[2024-06-20 19:54:44,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990691695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:44,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:44,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:44,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163723070]
[2024-06-20 19:54:44,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:44,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:44,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:44,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:44,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:44,563 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:44,564 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 195 transitions, 2368 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:54:44,564 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:44,564 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:44,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:45,764 INFO  L124   PetriNetUnfolderBase]: 2032/3026 cut-off events.
[2024-06-20 19:54:45,765 INFO  L125   PetriNetUnfolderBase]: For 59460/59466 co-relation queries the response was YES.
[2024-06-20 19:54:45,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19649 conditions, 3026 events. 2032/3026 cut-off events. For 59460/59466 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13941 event pairs, 572 based on Foata normal form. 10/3035 useless extension candidates. Maximal degree in co-relation 19583. Up to 2846 conditions per place. 
[2024-06-20 19:54:45,784 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 186 selfloop transitions, 49 changer transitions 0/238 dead transitions.
[2024-06-20 19:54:45,785 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 238 transitions, 3065 flow
[2024-06-20 19:54:45,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:45,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:45,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-20 19:54:45,788 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-20 19:54:45,788 INFO  L175             Difference]: Start difference. First operand has 141 places, 195 transitions, 2368 flow. Second operand 9 states and 148 transitions.
[2024-06-20 19:54:45,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 238 transitions, 3065 flow
[2024-06-20 19:54:45,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 238 transitions, 2980 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-20 19:54:45,830 INFO  L231             Difference]: Finished difference. Result has 147 places, 208 transitions, 2534 flow
[2024-06-20 19:54:45,830 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2534, PETRI_PLACES=147, PETRI_TRANSITIONS=208}
[2024-06-20 19:54:45,830 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 106 predicate places.
[2024-06-20 19:54:45,831 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 208 transitions, 2534 flow
[2024-06-20 19:54:45,831 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:54:45,831 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:45,831 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:45,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:54:45,831 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:45,831 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:45,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -993126197, now seen corresponding path program 3 times
[2024-06-20 19:54:45,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:45,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018671264]
[2024-06-20 19:54:45,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:45,832 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:45,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:54,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:54,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:54,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018671264]
[2024-06-20 19:54:54,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018671264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:54,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:54,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:54,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599365035]
[2024-06-20 19:54:54,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:54,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:54,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:54,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:54,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:54,148 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:54,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 208 transitions, 2534 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:54:54,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:54,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:54,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:55,449 INFO  L124   PetriNetUnfolderBase]: 2182/3243 cut-off events.
[2024-06-20 19:54:55,450 INFO  L125   PetriNetUnfolderBase]: For 70464/70466 co-relation queries the response was YES.
[2024-06-20 19:54:55,461 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21787 conditions, 3243 events. 2182/3243 cut-off events. For 70464/70466 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15019 event pairs, 525 based on Foata normal form. 6/3248 useless extension candidates. Maximal degree in co-relation 21719. Up to 2783 conditions per place. 
[2024-06-20 19:54:55,471 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 194 selfloop transitions, 66 changer transitions 0/263 dead transitions.
[2024-06-20 19:54:55,472 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 263 transitions, 3610 flow
[2024-06-20 19:54:55,473 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:55,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:55,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-20 19:54:55,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-20 19:54:55,474 INFO  L175             Difference]: Start difference. First operand has 147 places, 208 transitions, 2534 flow. Second operand 9 states and 157 transitions.
[2024-06-20 19:54:55,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 263 transitions, 3610 flow
[2024-06-20 19:54:55,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 263 transitions, 3573 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-20 19:54:55,532 INFO  L231             Difference]: Finished difference. Result has 156 places, 224 transitions, 2893 flow
[2024-06-20 19:54:55,532 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2893, PETRI_PLACES=156, PETRI_TRANSITIONS=224}
[2024-06-20 19:54:55,532 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places.
[2024-06-20 19:54:55,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 224 transitions, 2893 flow
[2024-06-20 19:54:55,533 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:54:55,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:55,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:55,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:54:55,533 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:55,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:55,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -993120400, now seen corresponding path program 1 times
[2024-06-20 19:54:55,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:55,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703277845]
[2024-06-20 19:54:55,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:55,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:55,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:04,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:04,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:04,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703277845]
[2024-06-20 19:55:04,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703277845] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:04,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:04,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:04,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187836686]
[2024-06-20 19:55:04,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:04,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:04,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:04,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:04,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:04,497 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:04,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 224 transitions, 2893 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:55:04,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:04,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:04,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:05,763 INFO  L124   PetriNetUnfolderBase]: 2177/3242 cut-off events.
[2024-06-20 19:55:05,763 INFO  L125   PetriNetUnfolderBase]: For 78539/78543 co-relation queries the response was YES.
[2024-06-20 19:55:05,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23107 conditions, 3242 events. 2177/3242 cut-off events. For 78539/78543 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15182 event pairs, 793 based on Foata normal form. 6/3247 useless extension candidates. Maximal degree in co-relation 23035. Up to 3167 conditions per place. 
[2024-06-20 19:55:05,785 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 227 selfloop transitions, 24 changer transitions 0/254 dead transitions.
[2024-06-20 19:55:05,785 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 254 transitions, 3521 flow
[2024-06-20 19:55:05,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:55:05,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:55:05,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-20 19:55:05,786 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39166666666666666
[2024-06-20 19:55:05,786 INFO  L175             Difference]: Start difference. First operand has 156 places, 224 transitions, 2893 flow. Second operand 9 states and 141 transitions.
[2024-06-20 19:55:05,786 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 254 transitions, 3521 flow
[2024-06-20 19:55:05,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 254 transitions, 3430 flow, removed 24 selfloop flow, removed 4 redundant places.
[2024-06-20 19:55:05,857 INFO  L231             Difference]: Finished difference. Result has 161 places, 226 transitions, 2884 flow
[2024-06-20 19:55:05,857 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2884, PETRI_PLACES=161, PETRI_TRANSITIONS=226}
[2024-06-20 19:55:05,858 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places.
[2024-06-20 19:55:05,858 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 226 transitions, 2884 flow
[2024-06-20 19:55:05,858 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:55:05,858 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:05,859 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:05,859 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:55:05,859 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:05,859 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:05,859 INFO  L85        PathProgramCache]: Analyzing trace with hash -2018228927, now seen corresponding path program 4 times
[2024-06-20 19:55:05,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:05,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188186825]
[2024-06-20 19:55:05,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:05,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:05,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:13,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:13,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:13,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188186825]
[2024-06-20 19:55:13,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188186825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:13,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:13,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:13,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729193009]
[2024-06-20 19:55:13,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:13,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:13,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:13,634 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:13,634 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:13,818 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:13,818 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 226 transitions, 2884 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:55:13,818 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:13,818 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:13,818 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:15,112 INFO  L124   PetriNetUnfolderBase]: 2157/3208 cut-off events.
[2024-06-20 19:55:15,113 INFO  L125   PetriNetUnfolderBase]: For 81038/81040 co-relation queries the response was YES.
[2024-06-20 19:55:15,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22752 conditions, 3208 events. 2157/3208 cut-off events. For 81038/81040 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14838 event pairs, 531 based on Foata normal form. 10/3217 useless extension candidates. Maximal degree in co-relation 22678. Up to 2768 conditions per place. 
[2024-06-20 19:55:15,138 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 187 selfloop transitions, 75 changer transitions 0/265 dead transitions.
[2024-06-20 19:55:15,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 265 transitions, 3717 flow
[2024-06-20 19:55:15,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:55:15,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:55:15,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-20 19:55:15,141 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-20 19:55:15,141 INFO  L175             Difference]: Start difference. First operand has 161 places, 226 transitions, 2884 flow. Second operand 9 states and 154 transitions.
[2024-06-20 19:55:15,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 265 transitions, 3717 flow
[2024-06-20 19:55:15,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 265 transitions, 3619 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-20 19:55:15,221 INFO  L231             Difference]: Finished difference. Result has 164 places, 231 transitions, 3051 flow
[2024-06-20 19:55:15,221 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3051, PETRI_PLACES=164, PETRI_TRANSITIONS=231}
[2024-06-20 19:55:15,221 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places.
[2024-06-20 19:55:15,221 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 231 transitions, 3051 flow
[2024-06-20 19:55:15,222 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:55:15,222 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:15,222 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:15,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:55:15,222 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:15,222 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:15,222 INFO  L85        PathProgramCache]: Analyzing trace with hash 988154700, now seen corresponding path program 3 times
[2024-06-20 19:55:15,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:15,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553033932]
[2024-06-20 19:55:15,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:15,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:15,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:22,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:22,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:22,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553033932]
[2024-06-20 19:55:22,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553033932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:22,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:22,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:22,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774838470]
[2024-06-20 19:55:22,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:22,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:22,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:22,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:22,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:22,930 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:55:22,931 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 231 transitions, 3051 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:22,931 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:22,931 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:55:22,931 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:24,280 INFO  L124   PetriNetUnfolderBase]: 2057/3094 cut-off events.
[2024-06-20 19:55:24,280 INFO  L125   PetriNetUnfolderBase]: For 93660/93889 co-relation queries the response was YES.
[2024-06-20 19:55:24,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22904 conditions, 3094 events. 2057/3094 cut-off events. For 93660/93889 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14721 event pairs, 668 based on Foata normal form. 27/3049 useless extension candidates. Maximal degree in co-relation 22828. Up to 2709 conditions per place. 
[2024-06-20 19:55:24,301 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 131 selfloop transitions, 87 changer transitions 0/254 dead transitions.
[2024-06-20 19:55:24,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 254 transitions, 3575 flow
[2024-06-20 19:55:24,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:55:24,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:55:24,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 19:55:24,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392857142857143
[2024-06-20 19:55:24,304 INFO  L175             Difference]: Start difference. First operand has 164 places, 231 transitions, 3051 flow. Second operand 7 states and 123 transitions.
[2024-06-20 19:55:24,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 254 transitions, 3575 flow
[2024-06-20 19:55:24,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 254 transitions, 3464 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 19:55:24,392 INFO  L231             Difference]: Finished difference. Result has 166 places, 231 transitions, 3170 flow
[2024-06-20 19:55:24,393 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3170, PETRI_PLACES=166, PETRI_TRANSITIONS=231}
[2024-06-20 19:55:24,393 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places.
[2024-06-20 19:55:24,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 231 transitions, 3170 flow
[2024-06-20 19:55:24,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:24,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:24,394 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:24,394 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:55:24,394 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:24,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:24,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1504326731, now seen corresponding path program 5 times
[2024-06-20 19:55:24,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:24,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715725488]
[2024-06-20 19:55:24,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:24,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:24,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:31,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:31,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:31,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715725488]
[2024-06-20 19:55:31,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715725488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:31,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:31,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:31,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007057109]
[2024-06-20 19:55:31,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:31,917 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:31,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:31,918 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:31,918 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:32,033 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:32,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 231 transitions, 3170 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:55:32,033 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:32,033 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:32,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:33,395 INFO  L124   PetriNetUnfolderBase]: 2171/3230 cut-off events.
[2024-06-20 19:55:33,396 INFO  L125   PetriNetUnfolderBase]: For 92437/92443 co-relation queries the response was YES.
[2024-06-20 19:55:33,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23643 conditions, 3230 events. 2171/3230 cut-off events. For 92437/92443 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15069 event pairs, 571 based on Foata normal form. 10/3239 useless extension candidates. Maximal degree in co-relation 23566. Up to 2966 conditions per place. 
[2024-06-20 19:55:33,419 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 203 selfloop transitions, 59 changer transitions 0/265 dead transitions.
[2024-06-20 19:55:33,420 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 265 transitions, 3890 flow
[2024-06-20 19:55:33,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:55:33,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:55:33,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-20 19:55:33,422 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4125
[2024-06-20 19:55:33,422 INFO  L175             Difference]: Start difference. First operand has 166 places, 231 transitions, 3170 flow. Second operand 8 states and 132 transitions.
[2024-06-20 19:55:33,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 265 transitions, 3890 flow
[2024-06-20 19:55:33,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 265 transitions, 3684 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-20 19:55:33,494 INFO  L231             Difference]: Finished difference. Result has 169 places, 237 transitions, 3214 flow
[2024-06-20 19:55:33,495 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3214, PETRI_PLACES=169, PETRI_TRANSITIONS=237}
[2024-06-20 19:55:33,495 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places.
[2024-06-20 19:55:33,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 237 transitions, 3214 flow
[2024-06-20 19:55:33,496 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:55:33,496 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:33,496 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:33,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:55:33,496 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:33,497 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:33,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 1508045801, now seen corresponding path program 6 times
[2024-06-20 19:55:33,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:33,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557555642]
[2024-06-20 19:55:33,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:33,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:33,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:39,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:39,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:39,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557555642]
[2024-06-20 19:55:39,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557555642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:39,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:39,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:55:39,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89181112]
[2024-06-20 19:55:39,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:39,762 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:55:39,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:39,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:55:39,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:55:39,843 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:39,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 237 transitions, 3214 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:55:39,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:39,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:39,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:41,408 INFO  L124   PetriNetUnfolderBase]: 2533/3750 cut-off events.
[2024-06-20 19:55:41,409 INFO  L125   PetriNetUnfolderBase]: For 99644/99646 co-relation queries the response was YES.
[2024-06-20 19:55:41,422 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27995 conditions, 3750 events. 2533/3750 cut-off events. For 99644/99646 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17769 event pairs, 596 based on Foata normal form. 6/3752 useless extension candidates. Maximal degree in co-relation 27916. Up to 3209 conditions per place. 
[2024-06-20 19:55:41,435 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 238 selfloop transitions, 96 changer transitions 0/337 dead transitions.
[2024-06-20 19:55:41,435 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 337 transitions, 5305 flow
[2024-06-20 19:55:41,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:55:41,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:55:41,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-20 19:55:41,438 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453125
[2024-06-20 19:55:41,438 INFO  L175             Difference]: Start difference. First operand has 169 places, 237 transitions, 3214 flow. Second operand 8 states and 145 transitions.
[2024-06-20 19:55:41,438 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 337 transitions, 5305 flow
[2024-06-20 19:55:41,535 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 337 transitions, 5206 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-20 19:55:41,539 INFO  L231             Difference]: Finished difference. Result has 175 places, 294 transitions, 4337 flow
[2024-06-20 19:55:41,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3135, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4337, PETRI_PLACES=175, PETRI_TRANSITIONS=294}
[2024-06-20 19:55:41,540 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places.
[2024-06-20 19:55:41,540 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 294 transitions, 4337 flow
[2024-06-20 19:55:41,540 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:55:41,540 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:41,540 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:41,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:55:41,541 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:41,541 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:41,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1508051598, now seen corresponding path program 2 times
[2024-06-20 19:55:41,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:41,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80506194]
[2024-06-20 19:55:41,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:41,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:41,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:49,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:49,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:49,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80506194]
[2024-06-20 19:55:49,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80506194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:49,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:49,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:49,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261230387]
[2024-06-20 19:55:49,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:49,067 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:49,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:49,068 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:49,068 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:49,206 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:49,207 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 294 transitions, 4337 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:55:49,207 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:49,207 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:49,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:50,644 INFO  L124   PetriNetUnfolderBase]: 2520/3734 cut-off events.
[2024-06-20 19:55:50,645 INFO  L125   PetriNetUnfolderBase]: For 110012/110014 co-relation queries the response was YES.
[2024-06-20 19:55:50,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29442 conditions, 3734 events. 2520/3734 cut-off events. For 110012/110014 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17740 event pairs, 584 based on Foata normal form. 10/3740 useless extension candidates. Maximal degree in co-relation 29359. Up to 3238 conditions per place. 
[2024-06-20 19:55:50,674 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 232 selfloop transitions, 110 changer transitions 0/345 dead transitions.
[2024-06-20 19:55:50,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 345 transitions, 5649 flow
[2024-06-20 19:55:50,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:55:50,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:55:50,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-20 19:55:50,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-20 19:55:50,677 INFO  L175             Difference]: Start difference. First operand has 175 places, 294 transitions, 4337 flow. Second operand 9 states and 148 transitions.
[2024-06-20 19:55:50,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 345 transitions, 5649 flow
[2024-06-20 19:55:50,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 345 transitions, 5595 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-06-20 19:55:50,812 INFO  L231             Difference]: Finished difference. Result has 186 places, 314 transitions, 4985 flow
[2024-06-20 19:55:50,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4291, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4985, PETRI_PLACES=186, PETRI_TRANSITIONS=314}
[2024-06-20 19:55:50,812 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places.
[2024-06-20 19:55:50,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 314 transitions, 4985 flow
[2024-06-20 19:55:50,813 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:55:50,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:50,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:50,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:55:50,813 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:50,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:50,814 INFO  L85        PathProgramCache]: Analyzing trace with hash 1508051381, now seen corresponding path program 7 times
[2024-06-20 19:55:50,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:50,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229881374]
[2024-06-20 19:55:50,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:50,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:50,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:57,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:57,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:57,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229881374]
[2024-06-20 19:55:57,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229881374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:57,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:57,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:57,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6498958]
[2024-06-20 19:55:57,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:57,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:57,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:57,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:57,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:57,695 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:57,695 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 314 transitions, 4985 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:55:57,695 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:57,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:57,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:59,155 INFO  L124   PetriNetUnfolderBase]: 2497/3703 cut-off events.
[2024-06-20 19:55:59,155 INFO  L125   PetriNetUnfolderBase]: For 116219/116221 co-relation queries the response was YES.
[2024-06-20 19:55:59,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30061 conditions, 3703 events. 2497/3703 cut-off events. For 116219/116221 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17590 event pairs, 542 based on Foata normal form. 10/3712 useless extension candidates. Maximal degree in co-relation 29972. Up to 2866 conditions per place. 
[2024-06-20 19:55:59,187 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 193 selfloop transitions, 148 changer transitions 0/344 dead transitions.
[2024-06-20 19:55:59,187 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 344 transitions, 5913 flow
[2024-06-20 19:55:59,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:55:59,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:55:59,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-20 19:55:59,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.428125
[2024-06-20 19:55:59,188 INFO  L175             Difference]: Start difference. First operand has 186 places, 314 transitions, 4985 flow. Second operand 8 states and 137 transitions.
[2024-06-20 19:55:59,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 344 transitions, 5913 flow
[2024-06-20 19:55:59,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 344 transitions, 5732 flow, removed 65 selfloop flow, removed 4 redundant places.
[2024-06-20 19:55:59,339 INFO  L231             Difference]: Finished difference. Result has 190 places, 314 transitions, 5126 flow
[2024-06-20 19:55:59,339 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4804, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5126, PETRI_PLACES=190, PETRI_TRANSITIONS=314}
[2024-06-20 19:55:59,339 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places.
[2024-06-20 19:55:59,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 314 transitions, 5126 flow
[2024-06-20 19:55:59,340 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:55:59,340 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:59,340 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:59,340 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:55:59,340 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:59,341 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:59,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -9236545, now seen corresponding path program 8 times
[2024-06-20 19:55:59,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:59,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795377392]
[2024-06-20 19:55:59,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:59,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:59,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:07,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 19:56:07,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:07,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795377392]
[2024-06-20 19:56:07,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795377392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:07,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:07,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:07,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675945421]
[2024-06-20 19:56:07,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:07,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:07,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:07,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:07,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:07,189 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:07,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 314 transitions, 5126 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:56:07,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:07,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:07,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:08,669 INFO  L124   PetriNetUnfolderBase]: 2551/3784 cut-off events.
[2024-06-20 19:56:08,669 INFO  L125   PetriNetUnfolderBase]: For 124549/124551 co-relation queries the response was YES.
[2024-06-20 19:56:08,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31328 conditions, 3784 events. 2551/3784 cut-off events. For 124549/124551 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18072 event pairs, 547 based on Foata normal form. 6/3786 useless extension candidates. Maximal degree in co-relation 31238. Up to 2730 conditions per place. 
[2024-06-20 19:56:08,697 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 212 selfloop transitions, 145 changer transitions 0/360 dead transitions.
[2024-06-20 19:56:08,698 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 360 transitions, 6524 flow
[2024-06-20 19:56:08,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:56:08,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:56:08,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-20 19:56:08,700 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453125
[2024-06-20 19:56:08,700 INFO  L175             Difference]: Start difference. First operand has 190 places, 314 transitions, 5126 flow. Second operand 8 states and 145 transitions.
[2024-06-20 19:56:08,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 360 transitions, 6524 flow
[2024-06-20 19:56:08,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 360 transitions, 6283 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-20 19:56:08,841 INFO  L231             Difference]: Finished difference. Result has 194 places, 327 transitions, 5438 flow
[2024-06-20 19:56:08,841 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4897, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5438, PETRI_PLACES=194, PETRI_TRANSITIONS=327}
[2024-06-20 19:56:08,841 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places.
[2024-06-20 19:56:08,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 327 transitions, 5438 flow
[2024-06-20 19:56:08,842 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:56:08,842 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:08,842 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:08,842 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:56:08,842 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:08,843 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:08,843 INFO  L85        PathProgramCache]: Analyzing trace with hash -9230965, now seen corresponding path program 9 times
[2024-06-20 19:56:08,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:08,843 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318971605]
[2024-06-20 19:56:08,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:08,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:08,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:16,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:16,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:16,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318971605]
[2024-06-20 19:56:16,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318971605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:16,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:16,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:16,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945287765]
[2024-06-20 19:56:16,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:16,501 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:16,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:16,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:16,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:16,664 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:16,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 327 transitions, 5438 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:56:16,665 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:16,665 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:16,665 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:18,270 INFO  L124   PetriNetUnfolderBase]: 2649/3927 cut-off events.
[2024-06-20 19:56:18,270 INFO  L125   PetriNetUnfolderBase]: For 135567/135569 co-relation queries the response was YES.
[2024-06-20 19:56:18,286 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33467 conditions, 3927 events. 2649/3927 cut-off events. For 135567/135569 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18845 event pairs, 560 based on Foata normal form. 10/3933 useless extension candidates. Maximal degree in co-relation 33375. Up to 2803 conditions per place. 
[2024-06-20 19:56:18,301 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 216 selfloop transitions, 149 changer transitions 0/368 dead transitions.
[2024-06-20 19:56:18,301 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 368 transitions, 6812 flow
[2024-06-20 19:56:18,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:56:18,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:56:18,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:56:18,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45625
[2024-06-20 19:56:18,304 INFO  L175             Difference]: Start difference. First operand has 194 places, 327 transitions, 5438 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:56:18,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 368 transitions, 6812 flow
[2024-06-20 19:56:18,463 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 368 transitions, 6427 flow, removed 81 selfloop flow, removed 4 redundant places.
[2024-06-20 19:56:18,468 INFO  L231             Difference]: Finished difference. Result has 199 places, 335 transitions, 5534 flow
[2024-06-20 19:56:18,468 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5099, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5534, PETRI_PLACES=199, PETRI_TRANSITIONS=335}
[2024-06-20 19:56:18,469 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 158 predicate places.
[2024-06-20 19:56:18,469 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 335 transitions, 5534 flow
[2024-06-20 19:56:18,469 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:56:18,469 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:18,469 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:18,469 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:56:18,469 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:18,469 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:18,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -9230748, now seen corresponding path program 3 times
[2024-06-20 19:56:18,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:18,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557708542]
[2024-06-20 19:56:18,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:18,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:18,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:26,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 19:56:26,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:26,065 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557708542]
[2024-06-20 19:56:26,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557708542] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:26,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:26,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:26,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428222319]
[2024-06-20 19:56:26,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:26,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:26,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:26,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:26,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:26,293 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:26,293 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 335 transitions, 5534 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:56:26,293 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:26,293 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:26,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:27,797 INFO  L124   PetriNetUnfolderBase]: 2628/3896 cut-off events.
[2024-06-20 19:56:27,797 INFO  L125   PetriNetUnfolderBase]: For 133606/133608 co-relation queries the response was YES.
[2024-06-20 19:56:27,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32503 conditions, 3896 events. 2628/3896 cut-off events. For 133606/133608 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18636 event pairs, 553 based on Foata normal form. 8/3900 useless extension candidates. Maximal degree in co-relation 32409. Up to 3112 conditions per place. 
[2024-06-20 19:56:27,829 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 227 selfloop transitions, 144 changer transitions 0/374 dead transitions.
[2024-06-20 19:56:27,829 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 374 transitions, 6800 flow
[2024-06-20 19:56:27,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:56:27,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:56:27,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-20 19:56:27,831 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-20 19:56:27,831 INFO  L175             Difference]: Start difference. First operand has 199 places, 335 transitions, 5534 flow. Second operand 8 states and 141 transitions.
[2024-06-20 19:56:27,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 374 transitions, 6800 flow
[2024-06-20 19:56:27,988 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 374 transitions, 6435 flow, removed 43 selfloop flow, removed 4 redundant places.
[2024-06-20 19:56:27,994 INFO  L231             Difference]: Finished difference. Result has 206 places, 344 transitions, 5782 flow
[2024-06-20 19:56:27,995 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5201, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5782, PETRI_PLACES=206, PETRI_TRANSITIONS=344}
[2024-06-20 19:56:27,995 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places.
[2024-06-20 19:56:27,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 344 transitions, 5782 flow
[2024-06-20 19:56:27,996 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:56:27,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:27,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:27,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:56:27,996 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:27,996 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:27,997 INFO  L85        PathProgramCache]: Analyzing trace with hash -1879098, now seen corresponding path program 4 times
[2024-06-20 19:56:27,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:27,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263278326]
[2024-06-20 19:56:27,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:27,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:28,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:34,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:34,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:34,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263278326]
[2024-06-20 19:56:34,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263278326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:34,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:34,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:34,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795136383]
[2024-06-20 19:56:34,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:34,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:34,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:34,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:34,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:35,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:35,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 344 transitions, 5782 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:56:35,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:35,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:35,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:36,694 INFO  L124   PetriNetUnfolderBase]: 2635/3908 cut-off events.
[2024-06-20 19:56:36,694 INFO  L125   PetriNetUnfolderBase]: For 139504/139506 co-relation queries the response was YES.
[2024-06-20 19:56:36,719 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33102 conditions, 3908 events. 2635/3908 cut-off events. For 139504/139506 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18771 event pairs, 518 based on Foata normal form. 8/3912 useless extension candidates. Maximal degree in co-relation 33004. Up to 3128 conditions per place. 
[2024-06-20 19:56:36,734 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 209 selfloop transitions, 167 changer transitions 0/379 dead transitions.
[2024-06-20 19:56:36,734 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 379 transitions, 6954 flow
[2024-06-20 19:56:36,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:56:36,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:56:36,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-20 19:56:36,736 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-20 19:56:36,737 INFO  L175             Difference]: Start difference. First operand has 206 places, 344 transitions, 5782 flow. Second operand 9 states and 151 transitions.
[2024-06-20 19:56:36,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 379 transitions, 6954 flow
[2024-06-20 19:56:36,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 379 transitions, 6777 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-20 19:56:36,923 INFO  L231             Difference]: Finished difference. Result has 211 places, 348 transitions, 6006 flow
[2024-06-20 19:56:36,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5606, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6006, PETRI_PLACES=211, PETRI_TRANSITIONS=348}
[2024-06-20 19:56:36,924 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places.
[2024-06-20 19:56:36,924 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 348 transitions, 6006 flow
[2024-06-20 19:56:36,924 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:56:36,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:36,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:36,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:56:36,925 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:36,925 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:36,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -1583187314, now seen corresponding path program 5 times
[2024-06-20 19:56:36,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:36,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340454725]
[2024-06-20 19:56:36,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:36,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:36,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:45,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:45,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:45,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340454725]
[2024-06-20 19:56:45,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340454725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:45,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:45,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:45,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322679623]
[2024-06-20 19:56:45,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:45,322 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:45,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:45,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:45,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:45,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:45,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 348 transitions, 6006 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:56:45,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:45,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:45,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:47,006 INFO  L124   PetriNetUnfolderBase]: 2630/3906 cut-off events.
[2024-06-20 19:56:47,006 INFO  L125   PetriNetUnfolderBase]: For 146453/146465 co-relation queries the response was YES.
[2024-06-20 19:56:47,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33469 conditions, 3906 events. 2630/3906 cut-off events. For 146453/146465 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18879 event pairs, 806 based on Foata normal form. 14/3918 useless extension candidates. Maximal degree in co-relation 33370. Up to 3699 conditions per place. 
[2024-06-20 19:56:47,039 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 311 selfloop transitions, 66 changer transitions 0/380 dead transitions.
[2024-06-20 19:56:47,039 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 380 transitions, 6926 flow
[2024-06-20 19:56:47,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:56:47,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:56:47,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-20 19:56:47,043 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39166666666666666
[2024-06-20 19:56:47,043 INFO  L175             Difference]: Start difference. First operand has 211 places, 348 transitions, 6006 flow. Second operand 9 states and 141 transitions.
[2024-06-20 19:56:47,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 380 transitions, 6926 flow
[2024-06-20 19:56:47,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 380 transitions, 6695 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-20 19:56:47,292 INFO  L231             Difference]: Finished difference. Result has 217 places, 354 transitions, 6015 flow
[2024-06-20 19:56:47,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5785, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6015, PETRI_PLACES=217, PETRI_TRANSITIONS=354}
[2024-06-20 19:56:47,292 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 176 predicate places.
[2024-06-20 19:56:47,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 354 transitions, 6015 flow
[2024-06-20 19:56:47,293 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:56:47,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:47,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:47,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:56:47,293 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:47,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:47,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -1583454441, now seen corresponding path program 10 times
[2024-06-20 19:56:47,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:47,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615857591]
[2024-06-20 19:56:47,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:47,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:47,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:54,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:54,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:54,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615857591]
[2024-06-20 19:56:54,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615857591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:54,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:54,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:54,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280486157]
[2024-06-20 19:56:54,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:54,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:54,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:54,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:54,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:54,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:54,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 354 transitions, 6015 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:56:54,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:54,987 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:54,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:56,515 INFO  L124   PetriNetUnfolderBase]: 2604/3863 cut-off events.
[2024-06-20 19:56:56,515 INFO  L125   PetriNetUnfolderBase]: For 149860/149862 co-relation queries the response was YES.
[2024-06-20 19:56:56,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32834 conditions, 3863 events. 2604/3863 cut-off events. For 149860/149862 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18483 event pairs, 511 based on Foata normal form. 10/3869 useless extension candidates. Maximal degree in co-relation 32733. Up to 2768 conditions per place. 
[2024-06-20 19:56:56,552 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 194 selfloop transitions, 185 changer transitions 0/382 dead transitions.
[2024-06-20 19:56:56,552 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 382 transitions, 7015 flow
[2024-06-20 19:56:56,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:56:56,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:56:56,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:56:56,555 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:56:56,555 INFO  L175             Difference]: Start difference. First operand has 217 places, 354 transitions, 6015 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:56:56,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 382 transitions, 7015 flow
[2024-06-20 19:56:56,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 382 transitions, 6807 flow, removed 32 selfloop flow, removed 8 redundant places.
[2024-06-20 19:56:56,778 INFO  L231             Difference]: Finished difference. Result has 217 places, 354 transitions, 6190 flow
[2024-06-20 19:56:56,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5807, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6190, PETRI_PLACES=217, PETRI_TRANSITIONS=354}
[2024-06-20 19:56:56,779 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 176 predicate places.
[2024-06-20 19:56:56,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 354 transitions, 6190 flow
[2024-06-20 19:56:56,779 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:56:56,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:56,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:56,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:56:56,779 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:56,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:56,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217278712, now seen corresponding path program 1 times
[2024-06-20 19:56:56,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:56,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048026054]
[2024-06-20 19:56:56,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:56,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:56,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:04,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:04,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:04,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048026054]
[2024-06-20 19:57:04,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048026054] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:04,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:04,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:04,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592281167]
[2024-06-20 19:57:04,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:04,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:04,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:04,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:04,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:05,079 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:57:05,079 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 354 transitions, 6190 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:05,079 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:05,079 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:57:05,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:06,603 INFO  L124   PetriNetUnfolderBase]: 2552/3822 cut-off events.
[2024-06-20 19:57:06,603 INFO  L125   PetriNetUnfolderBase]: For 170847/170980 co-relation queries the response was YES.
[2024-06-20 19:57:06,623 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33388 conditions, 3822 events. 2552/3822 cut-off events. For 170847/170980 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18842 event pairs, 710 based on Foata normal form. 15/3750 useless extension candidates. Maximal degree in co-relation 33287. Up to 3389 conditions per place. 
[2024-06-20 19:57:06,639 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 245 selfloop transitions, 69 changer transitions 0/391 dead transitions.
[2024-06-20 19:57:06,639 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 391 transitions, 6982 flow
[2024-06-20 19:57:06,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:06,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:06,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-20 19:57:06,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4305555555555556
[2024-06-20 19:57:06,642 INFO  L175             Difference]: Start difference. First operand has 217 places, 354 transitions, 6190 flow. Second operand 9 states and 155 transitions.
[2024-06-20 19:57:06,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 391 transitions, 6982 flow
[2024-06-20 19:57:06,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 391 transitions, 6598 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-20 19:57:06,895 INFO  L231             Difference]: Finished difference. Result has 220 places, 358 transitions, 6012 flow
[2024-06-20 19:57:06,895 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5806, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6012, PETRI_PLACES=220, PETRI_TRANSITIONS=358}
[2024-06-20 19:57:06,896 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places.
[2024-06-20 19:57:06,896 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 358 transitions, 6012 flow
[2024-06-20 19:57:06,896 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:06,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:06,896 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:06,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:57:06,897 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:06,897 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:06,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 800202284, now seen corresponding path program 2 times
[2024-06-20 19:57:06,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:06,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777394185]
[2024-06-20 19:57:06,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:06,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:06,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:14,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:14,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:14,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777394185]
[2024-06-20 19:57:14,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777394185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:14,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:14,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:14,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359607159]
[2024-06-20 19:57:14,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:14,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:14,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:14,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:14,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:15,113 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:57:15,114 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 358 transitions, 6012 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:15,114 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:15,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:57:15,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:16,571 INFO  L124   PetriNetUnfolderBase]: 2600/3910 cut-off events.
[2024-06-20 19:57:16,571 INFO  L125   PetriNetUnfolderBase]: For 181852/181931 co-relation queries the response was YES.
[2024-06-20 19:57:16,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33623 conditions, 3910 events. 2600/3910 cut-off events. For 181852/181931 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19558 event pairs, 548 based on Foata normal form. 33/3851 useless extension candidates. Maximal degree in co-relation 33520. Up to 3386 conditions per place. 
[2024-06-20 19:57:16,611 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 250 selfloop transitions, 73 changer transitions 0/400 dead transitions.
[2024-06-20 19:57:16,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 400 transitions, 6895 flow
[2024-06-20 19:57:16,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:16,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:16,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 19:57:16,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 19:57:16,613 INFO  L175             Difference]: Start difference. First operand has 220 places, 358 transitions, 6012 flow. Second operand 9 states and 153 transitions.
[2024-06-20 19:57:16,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 400 transitions, 6895 flow
[2024-06-20 19:57:16,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 400 transitions, 6696 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-20 19:57:16,852 INFO  L231             Difference]: Finished difference. Result has 224 places, 367 transitions, 6117 flow
[2024-06-20 19:57:16,852 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5850, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6117, PETRI_PLACES=224, PETRI_TRANSITIONS=367}
[2024-06-20 19:57:16,853 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places.
[2024-06-20 19:57:16,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 367 transitions, 6117 flow
[2024-06-20 19:57:16,853 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:16,853 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:16,853 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:16,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:57:16,854 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:16,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:16,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -495958280, now seen corresponding path program 1 times
[2024-06-20 19:57:16,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:16,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646429207]
[2024-06-20 19:57:16,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:16,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:16,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:24,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:24,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:24,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646429207]
[2024-06-20 19:57:24,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646429207] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:24,915 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:24,915 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:24,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260325536]
[2024-06-20 19:57:24,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:24,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:24,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:24,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:24,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:25,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:57:25,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 367 transitions, 6117 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:25,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:25,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:57:25,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:26,625 INFO  L124   PetriNetUnfolderBase]: 2762/4119 cut-off events.
[2024-06-20 19:57:26,626 INFO  L125   PetriNetUnfolderBase]: For 170502/170510 co-relation queries the response was YES.
[2024-06-20 19:57:26,648 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35065 conditions, 4119 events. 2762/4119 cut-off events. For 170502/170510 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20478 event pairs, 727 based on Foata normal form. 11/4129 useless extension candidates. Maximal degree in co-relation 34960. Up to 3842 conditions per place. 
[2024-06-20 19:57:26,665 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 323 selfloop transitions, 83 changer transitions 0/409 dead transitions.
[2024-06-20 19:57:26,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 409 transitions, 7298 flow
[2024-06-20 19:57:26,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:26,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:26,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-20 19:57:26,668 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-20 19:57:26,668 INFO  L175             Difference]: Start difference. First operand has 224 places, 367 transitions, 6117 flow. Second operand 9 states and 148 transitions.
[2024-06-20 19:57:26,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 409 transitions, 7298 flow
[2024-06-20 19:57:26,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 409 transitions, 7112 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-20 19:57:26,888 INFO  L231             Difference]: Finished difference. Result has 227 places, 377 transitions, 6398 flow
[2024-06-20 19:57:26,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5931, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6398, PETRI_PLACES=227, PETRI_TRANSITIONS=377}
[2024-06-20 19:57:26,889 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places.
[2024-06-20 19:57:26,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 377 transitions, 6398 flow
[2024-06-20 19:57:26,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:26,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:26,889 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:26,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:57:26,890 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:26,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:26,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -495925854, now seen corresponding path program 3 times
[2024-06-20 19:57:26,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:26,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242089565]
[2024-06-20 19:57:26,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:26,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:26,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:35,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:35,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:35,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242089565]
[2024-06-20 19:57:35,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242089565] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:35,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:35,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:35,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938844281]
[2024-06-20 19:57:35,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:35,541 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:35,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:35,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:35,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:35,736 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:57:35,736 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 377 transitions, 6398 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:35,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:35,736 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:57:35,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:37,391 INFO  L124   PetriNetUnfolderBase]: 2631/3971 cut-off events.
[2024-06-20 19:57:37,391 INFO  L125   PetriNetUnfolderBase]: For 200681/200775 co-relation queries the response was YES.
[2024-06-20 19:57:37,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34881 conditions, 3971 events. 2631/3971 cut-off events. For 200681/200775 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20062 event pairs, 657 based on Foata normal form. 19/3901 useless extension candidates. Maximal degree in co-relation 34775. Up to 3464 conditions per place. 
[2024-06-20 19:57:37,424 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 237 selfloop transitions, 91 changer transitions 0/411 dead transitions.
[2024-06-20 19:57:37,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 411 transitions, 7228 flow
[2024-06-20 19:57:37,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:37,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:37,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-20 19:57:37,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4305555555555556
[2024-06-20 19:57:37,426 INFO  L175             Difference]: Start difference. First operand has 227 places, 377 transitions, 6398 flow. Second operand 9 states and 155 transitions.
[2024-06-20 19:57:37,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 411 transitions, 7228 flow
[2024-06-20 19:57:37,658 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 411 transitions, 7071 flow, removed 40 selfloop flow, removed 4 redundant places.
[2024-06-20 19:57:37,664 INFO  L231             Difference]: Finished difference. Result has 232 places, 379 transitions, 6489 flow
[2024-06-20 19:57:37,664 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6241, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6489, PETRI_PLACES=232, PETRI_TRANSITIONS=379}
[2024-06-20 19:57:37,664 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places.
[2024-06-20 19:57:37,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 379 transitions, 6489 flow
[2024-06-20 19:57:37,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:37,665 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:37,665 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:37,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:57:37,665 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:37,665 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:37,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -278295364, now seen corresponding path program 1 times
[2024-06-20 19:57:37,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:37,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625977955]
[2024-06-20 19:57:37,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:37,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:37,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:45,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:45,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:45,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625977955]
[2024-06-20 19:57:45,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625977955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:45,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:45,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:57:45,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073070295]
[2024-06-20 19:57:45,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:45,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:57:45,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:45,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:57:45,511 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:57:45,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:57:45,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 379 transitions, 6489 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:45,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:45,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:57:45,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:47,276 INFO  L124   PetriNetUnfolderBase]: 2780/4144 cut-off events.
[2024-06-20 19:57:47,276 INFO  L125   PetriNetUnfolderBase]: For 187959/187963 co-relation queries the response was YES.
[2024-06-20 19:57:47,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35740 conditions, 4144 events. 2780/4144 cut-off events. For 187959/187963 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20450 event pairs, 555 based on Foata normal form. 8/4151 useless extension candidates. Maximal degree in co-relation 35633. Up to 3534 conditions per place. 
[2024-06-20 19:57:47,313 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 268 selfloop transitions, 142 changer transitions 0/413 dead transitions.
[2024-06-20 19:57:47,313 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 413 transitions, 7624 flow
[2024-06-20 19:57:47,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:47,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:47,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 19:57:47,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 19:57:47,315 INFO  L175             Difference]: Start difference. First operand has 232 places, 379 transitions, 6489 flow. Second operand 9 states and 153 transitions.
[2024-06-20 19:57:47,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 413 transitions, 7624 flow
[2024-06-20 19:57:47,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 413 transitions, 7412 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-20 19:57:47,587 INFO  L231             Difference]: Finished difference. Result has 235 places, 380 transitions, 6682 flow
[2024-06-20 19:57:47,587 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6277, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6682, PETRI_PLACES=235, PETRI_TRANSITIONS=380}
[2024-06-20 19:57:47,587 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 194 predicate places.
[2024-06-20 19:57:47,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 380 transitions, 6682 flow
[2024-06-20 19:57:47,588 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:47,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:47,588 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:47,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:57:47,588 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:47,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:47,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 19175872, now seen corresponding path program 4 times
[2024-06-20 19:57:47,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:47,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417176907]
[2024-06-20 19:57:47,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:47,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:47,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:55,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:55,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:55,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417176907]
[2024-06-20 19:57:55,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417176907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:55,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:55,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:55,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031519385]
[2024-06-20 19:57:55,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:55,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:55,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:55,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:55,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:55,970 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:57:55,970 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 380 transitions, 6682 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:55,970 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:55,970 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:57:55,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:57,672 INFO  L124   PetriNetUnfolderBase]: 2701/4076 cut-off events.
[2024-06-20 19:57:57,672 INFO  L125   PetriNetUnfolderBase]: For 217200/217336 co-relation queries the response was YES.
[2024-06-20 19:57:57,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36189 conditions, 4076 events. 2701/4076 cut-off events. For 217200/217336 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20751 event pairs, 505 based on Foata normal form. 53/4029 useless extension candidates. Maximal degree in co-relation 36080. Up to 3582 conditions per place. 
[2024-06-20 19:57:57,712 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 266 selfloop transitions, 74 changer transitions 0/423 dead transitions.
[2024-06-20 19:57:57,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 423 transitions, 7591 flow
[2024-06-20 19:57:57,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:57,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:57,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:57:57,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:57:57,715 INFO  L175             Difference]: Start difference. First operand has 235 places, 380 transitions, 6682 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:57:57,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 423 transitions, 7591 flow
[2024-06-20 19:57:57,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 423 transitions, 7213 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-20 19:57:57,993 INFO  L231             Difference]: Finished difference. Result has 238 places, 392 transitions, 6618 flow
[2024-06-20 19:57:57,993 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6304, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6618, PETRI_PLACES=238, PETRI_TRANSITIONS=392}
[2024-06-20 19:57:57,994 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 197 predicate places.
[2024-06-20 19:57:57,994 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 392 transitions, 6618 flow
[2024-06-20 19:57:57,994 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:57,994 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:57,994 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:57,994 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:57:57,994 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:57,995 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:57,995 INFO  L85        PathProgramCache]: Analyzing trace with hash 1741147904, now seen corresponding path program 5 times
[2024-06-20 19:57:57,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:57,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150825379]
[2024-06-20 19:57:57,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:57,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:58,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:05,088 INFO  L134       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:05,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:05,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150825379]
[2024-06-20 19:58:05,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150825379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:05,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:05,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:05,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590699629]
[2024-06-20 19:58:05,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:05,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:05,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:05,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:05,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:05,271 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:58:05,271 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 392 transitions, 6618 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:05,271 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:05,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:58:05,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:06,983 INFO  L124   PetriNetUnfolderBase]: 2722/4121 cut-off events.
[2024-06-20 19:58:06,984 INFO  L125   PetriNetUnfolderBase]: For 228040/228244 co-relation queries the response was YES.
[2024-06-20 19:58:07,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36547 conditions, 4121 events. 2722/4121 cut-off events. For 228040/228244 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21187 event pairs, 512 based on Foata normal form. 51/4071 useless extension candidates. Maximal degree in co-relation 36436. Up to 3607 conditions per place. 
[2024-06-20 19:58:07,023 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 253 selfloop transitions, 90 changer transitions 0/426 dead transitions.
[2024-06-20 19:58:07,024 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 426 transitions, 7482 flow
[2024-06-20 19:58:07,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:58:07,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:58:07,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:58:07,025 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:58:07,025 INFO  L175             Difference]: Start difference. First operand has 238 places, 392 transitions, 6618 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:58:07,025 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 426 transitions, 7482 flow
[2024-06-20 19:58:07,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 426 transitions, 7316 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 19:58:07,292 INFO  L231             Difference]: Finished difference. Result has 241 places, 396 transitions, 6720 flow
[2024-06-20 19:58:07,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6452, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6720, PETRI_PLACES=241, PETRI_TRANSITIONS=396}
[2024-06-20 19:58:07,293 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 200 predicate places.
[2024-06-20 19:58:07,293 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 396 transitions, 6720 flow
[2024-06-20 19:58:07,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:07,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:07,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:07,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:58:07,294 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:07,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:07,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -799954932, now seen corresponding path program 2 times
[2024-06-20 19:58:07,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:07,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5790264]
[2024-06-20 19:58:07,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:07,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:07,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:15,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 19:58:15,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:15,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5790264]
[2024-06-20 19:58:15,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5790264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:15,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:15,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:15,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976911850]
[2024-06-20 19:58:15,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:15,611 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:15,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:15,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:15,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:15,782 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:15,782 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 396 transitions, 6720 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:15,782 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:15,782 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:15,783 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:17,381 INFO  L124   PetriNetUnfolderBase]: 2945/4402 cut-off events.
[2024-06-20 19:58:17,381 INFO  L125   PetriNetUnfolderBase]: For 210371/210381 co-relation queries the response was YES.
[2024-06-20 19:58:17,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37959 conditions, 4402 events. 2945/4402 cut-off events. For 210371/210381 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22363 event pairs, 619 based on Foata normal form. 13/4414 useless extension candidates. Maximal degree in co-relation 37847. Up to 4126 conditions per place. 
[2024-06-20 19:58:17,425 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 342 selfloop transitions, 86 changer transitions 0/431 dead transitions.
[2024-06-20 19:58:17,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 431 transitions, 7783 flow
[2024-06-20 19:58:17,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:58:17,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:58:17,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 19:58:17,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 19:58:17,426 INFO  L175             Difference]: Start difference. First operand has 241 places, 396 transitions, 6720 flow. Second operand 9 states and 149 transitions.
[2024-06-20 19:58:17,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 431 transitions, 7783 flow
[2024-06-20 19:58:17,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 431 transitions, 7556 flow, removed 42 selfloop flow, removed 6 redundant places.
[2024-06-20 19:58:17,731 INFO  L231             Difference]: Finished difference. Result has 245 places, 401 transitions, 6812 flow
[2024-06-20 19:58:17,731 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6493, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6812, PETRI_PLACES=245, PETRI_TRANSITIONS=401}
[2024-06-20 19:58:17,732 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places.
[2024-06-20 19:58:17,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 401 transitions, 6812 flow
[2024-06-20 19:58:17,732 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:17,732 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:17,732 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:17,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:58:17,733 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:17,733 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:17,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859235584, now seen corresponding path program 6 times
[2024-06-20 19:58:17,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:17,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122325487]
[2024-06-20 19:58:17,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:17,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:17,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:26,513 INFO  L134       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:26,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:26,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122325487]
[2024-06-20 19:58:26,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122325487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:26,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:26,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:26,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319337340]
[2024-06-20 19:58:26,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:26,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:26,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:26,514 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:26,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:26,743 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:58:26,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 401 transitions, 6812 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:26,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:26,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:58:26,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:28,393 INFO  L124   PetriNetUnfolderBase]: 2739/4146 cut-off events.
[2024-06-20 19:58:28,393 INFO  L125   PetriNetUnfolderBase]: For 246495/246712 co-relation queries the response was YES.
[2024-06-20 19:58:28,417 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37246 conditions, 4146 events. 2739/4146 cut-off events. For 246495/246712 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21256 event pairs, 503 based on Foata normal form. 48/4092 useless extension candidates. Maximal degree in co-relation 37132. Up to 3559 conditions per place. 
[2024-06-20 19:58:28,436 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 234 selfloop transitions, 114 changer transitions 0/434 dead transitions.
[2024-06-20 19:58:28,436 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 434 transitions, 7694 flow
[2024-06-20 19:58:28,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:58:28,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:58:28,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:58:28,437 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:58:28,437 INFO  L175             Difference]: Start difference. First operand has 245 places, 401 transitions, 6812 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:58:28,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 434 transitions, 7694 flow
[2024-06-20 19:58:28,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 434 transitions, 7439 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 19:58:28,759 INFO  L231             Difference]: Finished difference. Result has 248 places, 403 transitions, 6856 flow
[2024-06-20 19:58:28,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6557, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6856, PETRI_PLACES=248, PETRI_TRANSITIONS=403}
[2024-06-20 19:58:28,760 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 207 predicate places.
[2024-06-20 19:58:28,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 403 transitions, 6856 flow
[2024-06-20 19:58:28,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:28,761 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:28,761 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:28,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:58:28,761 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:28,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:28,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -721960476, now seen corresponding path program 1 times
[2024-06-20 19:58:28,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:28,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954016993]
[2024-06-20 19:58:28,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:28,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:28,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:37,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:37,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:37,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954016993]
[2024-06-20 19:58:37,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954016993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:37,617 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:37,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:37,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081883329]
[2024-06-20 19:58:37,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:37,617 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:37,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:37,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:37,617 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:37,865 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:37,865 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 403 transitions, 6856 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:37,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:37,865 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:37,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:39,709 INFO  L124   PetriNetUnfolderBase]: 3062/4593 cut-off events.
[2024-06-20 19:58:39,709 INFO  L125   PetriNetUnfolderBase]: For 240887/240891 co-relation queries the response was YES.
[2024-06-20 19:58:39,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39235 conditions, 4593 events. 3062/4593 cut-off events. For 240887/240891 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23621 event pairs, 619 based on Foata normal form. 28/4620 useless extension candidates. Maximal degree in co-relation 39120. Up to 3832 conditions per place. 
[2024-06-20 19:58:39,752 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 293 selfloop transitions, 149 changer transitions 0/445 dead transitions.
[2024-06-20 19:58:39,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 445 transitions, 7956 flow
[2024-06-20 19:58:39,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:39,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:39,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions.
[2024-06-20 19:58:39,755 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4225
[2024-06-20 19:58:39,755 INFO  L175             Difference]: Start difference. First operand has 248 places, 403 transitions, 6856 flow. Second operand 10 states and 169 transitions.
[2024-06-20 19:58:39,755 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 445 transitions, 7956 flow
[2024-06-20 19:58:40,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 445 transitions, 7679 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-20 19:58:40,084 INFO  L231             Difference]: Finished difference. Result has 251 places, 405 transitions, 6921 flow
[2024-06-20 19:58:40,084 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6579, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6921, PETRI_PLACES=251, PETRI_TRANSITIONS=405}
[2024-06-20 19:58:40,084 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places.
[2024-06-20 19:58:40,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 405 transitions, 6921 flow
[2024-06-20 19:58:40,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:40,085 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:40,085 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:40,085 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:58:40,085 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:40,085 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:40,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 454461134, now seen corresponding path program 7 times
[2024-06-20 19:58:40,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:40,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344198317]
[2024-06-20 19:58:40,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:40,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:40,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:48,390 INFO  L134       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,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:48,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344198317]
[2024-06-20 19:58:48,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344198317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:48,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:48,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:48,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716378420]
[2024-06-20 19:58:48,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:48,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:48,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:48,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:48,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:48,603 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:58:48,603 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 405 transitions, 6921 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:48,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:48,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:58:48,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:50,361 INFO  L124   PetriNetUnfolderBase]: 2837/4312 cut-off events.
[2024-06-20 19:58:50,361 INFO  L125   PetriNetUnfolderBase]: For 266375/266624 co-relation queries the response was YES.
[2024-06-20 19:58:50,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38512 conditions, 4312 events. 2837/4312 cut-off events. For 266375/266624 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 22481 event pairs, 601 based on Foata normal form. 130/4337 useless extension candidates. Maximal degree in co-relation 38396. Up to 3637 conditions per place. 
[2024-06-20 19:58:50,400 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 261 selfloop transitions, 87 changer transitions 0/435 dead transitions.
[2024-06-20 19:58:50,400 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 435 transitions, 7791 flow
[2024-06-20 19:58:50,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:58:50,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:58:50,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-20 19:58:50,403 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.428125
[2024-06-20 19:58:50,403 INFO  L175             Difference]: Start difference. First operand has 251 places, 405 transitions, 6921 flow. Second operand 8 states and 137 transitions.
[2024-06-20 19:58:50,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 435 transitions, 7791 flow
[2024-06-20 19:58:50,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 435 transitions, 7481 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-20 19:58:50,699 INFO  L231             Difference]: Finished difference. Result has 251 places, 407 transitions, 6876 flow
[2024-06-20 19:58:50,700 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6611, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6876, PETRI_PLACES=251, PETRI_TRANSITIONS=407}
[2024-06-20 19:58:50,700 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places.
[2024-06-20 19:58:50,700 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 407 transitions, 6876 flow
[2024-06-20 19:58:50,700 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:50,700 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:50,700 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:50,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:58:50,701 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:50,701 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:50,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 457202774, now seen corresponding path program 8 times
[2024-06-20 19:58:50,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:50,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928661500]
[2024-06-20 19:58:50,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:50,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:50,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:58,973 INFO  L134       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:58,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:58,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928661500]
[2024-06-20 19:58:58,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928661500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:58,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:58,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:58,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877373708]
[2024-06-20 19:58:58,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:58,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:58,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:58,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:58,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:59,127 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:58:59,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 407 transitions, 6876 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:59,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:59,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:58:59,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:00,925 INFO  L124   PetriNetUnfolderBase]: 2853/4361 cut-off events.
[2024-06-20 19:59:00,926 INFO  L125   PetriNetUnfolderBase]: For 277847/278107 co-relation queries the response was YES.
[2024-06-20 19:59:00,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39094 conditions, 4361 events. 2853/4361 cut-off events. For 277847/278107 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23114 event pairs, 708 based on Foata normal form. 61/4317 useless extension candidates. Maximal degree in co-relation 38977. Up to 3683 conditions per place. 
[2024-06-20 19:59:00,973 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 235 selfloop transitions, 115 changer transitions 0/437 dead transitions.
[2024-06-20 19:59:00,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 437 transitions, 7758 flow
[2024-06-20 19:59:00,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:00,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:00,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-20 19:59:00,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43125
[2024-06-20 19:59:00,975 INFO  L175             Difference]: Start difference. First operand has 251 places, 407 transitions, 6876 flow. Second operand 8 states and 138 transitions.
[2024-06-20 19:59:00,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 437 transitions, 7758 flow
[2024-06-20 19:59:01,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 437 transitions, 7538 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-20 19:59:01,511 INFO  L231             Difference]: Finished difference. Result has 254 places, 409 transitions, 6988 flow
[2024-06-20 19:59:01,512 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6668, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6988, PETRI_PLACES=254, PETRI_TRANSITIONS=409}
[2024-06-20 19:59:01,512 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 213 predicate places.
[2024-06-20 19:59:01,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 409 transitions, 6988 flow
[2024-06-20 19:59:01,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:01,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:01,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:01,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:59:01,513 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:01,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:01,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -613312120, now seen corresponding path program 3 times
[2024-06-20 19:59:01,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:01,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47653615]
[2024-06-20 19:59:01,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:01,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:01,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:09,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:09,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:09,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47653615]
[2024-06-20 19:59:09,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47653615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:09,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:09,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:59:09,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87573084]
[2024-06-20 19:59:09,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:09,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:59:09,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:09,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:59:09,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:59:09,600 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:09,600 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 409 transitions, 6988 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:09,601 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:09,601 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:09,601 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:11,462 INFO  L124   PetriNetUnfolderBase]: 3104/4668 cut-off events.
[2024-06-20 19:59:11,463 INFO  L125   PetriNetUnfolderBase]: For 222491/222499 co-relation queries the response was YES.
[2024-06-20 19:59:11,487 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39627 conditions, 4668 events. 3104/4668 cut-off events. For 222491/222499 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 24365 event pairs, 827 based on Foata normal form. 10/4677 useless extension candidates. Maximal degree in co-relation 39509. Up to 4232 conditions per place. 
[2024-06-20 19:59:11,506 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 316 selfloop transitions, 118 changer transitions 0/437 dead transitions.
[2024-06-20 19:59:11,507 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 437 transitions, 7976 flow
[2024-06-20 19:59:11,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:11,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:11,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-20 19:59:11,509 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4125
[2024-06-20 19:59:11,509 INFO  L175             Difference]: Start difference. First operand has 254 places, 409 transitions, 6988 flow. Second operand 8 states and 132 transitions.
[2024-06-20 19:59:11,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 437 transitions, 7976 flow
[2024-06-20 19:59:11,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 437 transitions, 7700 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:11,876 INFO  L231             Difference]: Finished difference. Result has 256 places, 409 transitions, 7000 flow
[2024-06-20 19:59:11,876 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6712, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7000, PETRI_PLACES=256, PETRI_TRANSITIONS=409}
[2024-06-20 19:59:11,877 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 215 predicate places.
[2024-06-20 19:59:11,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 409 transitions, 7000 flow
[2024-06-20 19:59:11,877 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:11,877 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:11,877 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:11,877 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:59:11,877 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:11,877 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:11,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 572609264, now seen corresponding path program 9 times
[2024-06-20 19:59:11,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:11,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601069048]
[2024-06-20 19:59:11,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:11,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:11,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:20,973 INFO  L134       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:20,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:20,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601069048]
[2024-06-20 19:59:20,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601069048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:20,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:20,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:59:20,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369393083]
[2024-06-20 19:59:20,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:20,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:59:20,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:20,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:59:20,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:59:21,186 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:59:21,186 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 409 transitions, 7000 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:21,186 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:21,186 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:59:21,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:22,985 INFO  L124   PetriNetUnfolderBase]: 2855/4350 cut-off events.
[2024-06-20 19:59:22,985 INFO  L125   PetriNetUnfolderBase]: For 236445/236701 co-relation queries the response was YES.
[2024-06-20 19:59:23,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37718 conditions, 4350 events. 2855/4350 cut-off events. For 236445/236701 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22859 event pairs, 514 based on Foata normal form. 61/4303 useless extension candidates. Maximal degree in co-relation 37599. Up to 3665 conditions per place. 
[2024-06-20 19:59:23,025 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 221 selfloop transitions, 130 changer transitions 0/438 dead transitions.
[2024-06-20 19:59:23,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 438 transitions, 7868 flow
[2024-06-20 19:59:23,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:23,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:23,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-20 19:59:23,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43125
[2024-06-20 19:59:23,027 INFO  L175             Difference]: Start difference. First operand has 256 places, 409 transitions, 7000 flow. Second operand 8 states and 138 transitions.
[2024-06-20 19:59:23,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 438 transitions, 7868 flow
[2024-06-20 19:59:23,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 438 transitions, 7629 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:23,491 INFO  L231             Difference]: Finished difference. Result has 258 places, 411 transitions, 7088 flow
[2024-06-20 19:59:23,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6761, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7088, PETRI_PLACES=258, PETRI_TRANSITIONS=411}
[2024-06-20 19:59:23,492 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places.
[2024-06-20 19:59:23,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 411 transitions, 7088 flow
[2024-06-20 19:59:23,492 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:23,492 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:23,492 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:23,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:59:23,492 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:23,493 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:23,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 572793962, now seen corresponding path program 2 times
[2024-06-20 19:59:23,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:23,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079804733]
[2024-06-20 19:59:23,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:23,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:23,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:31,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:31,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:31,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079804733]
[2024-06-20 19:59:31,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079804733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:31,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:31,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:59:31,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714387400]
[2024-06-20 19:59:31,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:31,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:59:31,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:31,589 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:59:31,589 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:59:31,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:31,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 411 transitions, 7088 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:31,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:31,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:31,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:33,726 INFO  L124   PetriNetUnfolderBase]: 3221/4850 cut-off events.
[2024-06-20 19:59:33,726 INFO  L125   PetriNetUnfolderBase]: For 225997/226001 co-relation queries the response was YES.
[2024-06-20 19:59:33,756 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40129 conditions, 4850 events. 3221/4850 cut-off events. For 225997/226001 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25361 event pairs, 621 based on Foata normal form. 28/4877 useless extension candidates. Maximal degree in co-relation 40009. Up to 3758 conditions per place. 
[2024-06-20 19:59:33,776 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 270 selfloop transitions, 176 changer transitions 0/449 dead transitions.
[2024-06-20 19:59:33,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 449 transitions, 8188 flow
[2024-06-20 19:59:33,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:33,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:33,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-20 19:59:33,778 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4222222222222222
[2024-06-20 19:59:33,778 INFO  L175             Difference]: Start difference. First operand has 258 places, 411 transitions, 7088 flow. Second operand 9 states and 152 transitions.
[2024-06-20 19:59:33,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 449 transitions, 8188 flow
[2024-06-20 19:59:34,264 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 449 transitions, 7885 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:34,270 INFO  L231             Difference]: Finished difference. Result has 261 places, 413 transitions, 7190 flow
[2024-06-20 19:59:34,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6785, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7190, PETRI_PLACES=261, PETRI_TRANSITIONS=413}
[2024-06-20 19:59:34,271 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places.
[2024-06-20 19:59:34,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 413 transitions, 7190 flow
[2024-06-20 19:59:34,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:34,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:34,271 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:34,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:59:34,271 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:34,272 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:34,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -49976976, now seen corresponding path program 3 times
[2024-06-20 19:59:34,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:34,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878865390]
[2024-06-20 19:59:34,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:34,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:34,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:41,841 INFO  L134       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:41,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:41,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878865390]
[2024-06-20 19:59:41,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878865390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:41,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:41,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:59:41,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109190620]
[2024-06-20 19:59:41,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:41,842 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:59:41,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:41,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:59:41,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:59:42,013 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:42,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 413 transitions, 7190 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:42,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:42,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:42,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:43,866 INFO  L124   PetriNetUnfolderBase]: 3238/4880 cut-off events.
[2024-06-20 19:59:43,866 INFO  L125   PetriNetUnfolderBase]: For 211329/211335 co-relation queries the response was YES.
[2024-06-20 19:59:43,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40596 conditions, 4880 events. 3238/4880 cut-off events. For 211329/211335 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25621 event pairs, 630 based on Foata normal form. 10/4886 useless extension candidates. Maximal degree in co-relation 40475. Up to 3841 conditions per place. 
[2024-06-20 19:59:43,908 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 230 selfloop transitions, 212 changer transitions 0/445 dead transitions.
[2024-06-20 19:59:43,908 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 445 transitions, 8244 flow
[2024-06-20 19:59:43,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:43,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:43,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 19:59:43,910 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 19:59:43,910 INFO  L175             Difference]: Start difference. First operand has 261 places, 413 transitions, 7190 flow. Second operand 9 states and 149 transitions.
[2024-06-20 19:59:43,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 445 transitions, 8244 flow
[2024-06-20 19:59:44,264 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 445 transitions, 7873 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-20 19:59:44,270 INFO  L231             Difference]: Finished difference. Result has 263 places, 415 transitions, 7290 flow
[2024-06-20 19:59:44,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6823, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7290, PETRI_PLACES=263, PETRI_TRANSITIONS=415}
[2024-06-20 19:59:44,270 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places.
[2024-06-20 19:59:44,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 415 transitions, 7290 flow
[2024-06-20 19:59:44,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:44,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:44,271 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:44,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:59:44,271 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:44,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:44,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -49680306, now seen corresponding path program 4 times
[2024-06-20 19:59:44,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:44,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793932868]
[2024-06-20 19:59:44,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:44,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:44,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:52,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:52,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:52,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793932868]
[2024-06-20 19:59:52,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793932868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:52,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:52,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:59:52,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773907636]
[2024-06-20 19:59:52,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:52,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:59:52,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:52,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:59:52,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:59:52,257 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:52,257 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 415 transitions, 7290 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:52,257 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:52,257 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:52,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:54,183 INFO  L124   PetriNetUnfolderBase]: 3366/5088 cut-off events.
[2024-06-20 19:59:54,183 INFO  L125   PetriNetUnfolderBase]: For 226997/227003 co-relation queries the response was YES.
[2024-06-20 19:59:54,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42424 conditions, 5088 events. 3366/5088 cut-off events. For 226997/227003 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 26949 event pairs, 579 based on Foata normal form. 10/5094 useless extension candidates. Maximal degree in co-relation 42302. Up to 3510 conditions per place. 
[2024-06-20 19:59:54,234 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 232 selfloop transitions, 221 changer transitions 0/456 dead transitions.
[2024-06-20 19:59:54,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 456 transitions, 8600 flow
[2024-06-20 19:59:54,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:54,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:54,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:59:54,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:59:54,236 INFO  L175             Difference]: Start difference. First operand has 263 places, 415 transitions, 7290 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:59:54,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 456 transitions, 8600 flow
[2024-06-20 19:59:54,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 456 transitions, 8149 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:54,621 INFO  L231             Difference]: Finished difference. Result has 266 places, 419 transitions, 7364 flow
[2024-06-20 19:59:54,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6839, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7364, PETRI_PLACES=266, PETRI_TRANSITIONS=419}
[2024-06-20 19:59:54,622 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places.
[2024-06-20 19:59:54,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 419 transitions, 7364 flow
[2024-06-20 19:59:54,623 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:59:54,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:54,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:54,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:59:54,623 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:54,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:54,624 INFO  L85        PathProgramCache]: Analyzing trace with hash -286152336, now seen corresponding path program 5 times
[2024-06-20 19:59:54,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:54,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003706513]
[2024-06-20 19:59:54,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:54,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:54,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:02,443 INFO  L134       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:02,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:02,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003706513]
[2024-06-20 20:00:02,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003706513] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:02,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:02,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:00:02,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587863913]
[2024-06-20 20:00:02,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:02,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:00:02,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:02,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:00:02,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:00:02,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 20:00:02,558 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 419 transitions, 7364 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:02,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:02,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 20:00:02,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:04,402 INFO  L124   PetriNetUnfolderBase]: 3383/5118 cut-off events.
[2024-06-20 20:00:04,402 INFO  L125   PetriNetUnfolderBase]: For 239583/239595 co-relation queries the response was YES.
[2024-06-20 20:00:04,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43099 conditions, 5118 events. 3383/5118 cut-off events. For 239583/239595 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 27403 event pairs, 1016 based on Foata normal form. 16/5132 useless extension candidates. Maximal degree in co-relation 42976. Up to 4935 conditions per place. 
[2024-06-20 20:00:04,460 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 398 selfloop transitions, 47 changer transitions 0/448 dead transitions.
[2024-06-20 20:00:04,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 448 transitions, 8410 flow
[2024-06-20 20:00:04,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:04,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:04,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 20:00:04,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 20:00:04,463 INFO  L175             Difference]: Start difference. First operand has 266 places, 419 transitions, 7364 flow. Second operand 9 states and 150 transitions.
[2024-06-20 20:00:04,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 448 transitions, 8410 flow
[2024-06-20 20:00:04,993 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 448 transitions, 8055 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-20 20:00:04,999 INFO  L231             Difference]: Finished difference. Result has 269 places, 421 transitions, 7154 flow
[2024-06-20 20:00:04,999 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7019, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7154, PETRI_PLACES=269, PETRI_TRANSITIONS=421}
[2024-06-20 20:00:04,999 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places.
[2024-06-20 20:00:04,999 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 421 transitions, 7154 flow
[2024-06-20 20:00:05,000 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:05,000 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:05,000 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:05,000 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 20:00:05,000 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:00:05,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:05,001 INFO  L85        PathProgramCache]: Analyzing trace with hash -58251186, now seen corresponding path program 6 times
[2024-06-20 20:00:05,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:05,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100420957]
[2024-06-20 20:00:05,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:05,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:05,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:12,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:12,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:12,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100420957]
[2024-06-20 20:00:12,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100420957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:12,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:12,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:00:12,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782138006]
[2024-06-20 20:00:12,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:12,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:00:12,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:12,774 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:00:12,774 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:00:12,895 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 20:00:12,895 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 421 transitions, 7154 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:12,895 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:12,895 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 20:00:12,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:14,822 INFO  L124   PetriNetUnfolderBase]: 3375/5106 cut-off events.
[2024-06-20 20:00:14,822 INFO  L125   PetriNetUnfolderBase]: For 239629/239641 co-relation queries the response was YES.
[2024-06-20 20:00:14,848 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42505 conditions, 5106 events. 3375/5106 cut-off events. For 239629/239641 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 27285 event pairs, 1014 based on Foata normal form. 16/5120 useless extension candidates. Maximal degree in co-relation 42381. Up to 4923 conditions per place. 
[2024-06-20 20:00:14,866 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 396 selfloop transitions, 50 changer transitions 0/449 dead transitions.
[2024-06-20 20:00:14,866 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 449 transitions, 8178 flow
[2024-06-20 20:00:14,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:14,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:14,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 20:00:14,869 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 20:00:14,869 INFO  L175             Difference]: Start difference. First operand has 269 places, 421 transitions, 7154 flow. Second operand 9 states and 149 transitions.
[2024-06-20 20:00:14,869 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 449 transitions, 8178 flow
[2024-06-20 20:00:15,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 449 transitions, 8069 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-20 20:00:15,273 INFO  L231             Difference]: Finished difference. Result has 272 places, 422 transitions, 7170 flow
[2024-06-20 20:00:15,273 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7170, PETRI_PLACES=272, PETRI_TRANSITIONS=422}
[2024-06-20 20:00:15,274 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places.
[2024-06-20 20:00:15,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 422 transitions, 7170 flow
[2024-06-20 20:00:15,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:15,274 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:15,274 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,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 20:00:15,274 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:15,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:15,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -286337034, now seen corresponding path program 10 times
[2024-06-20 20:00:15,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:15,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877982409]
[2024-06-20 20:00:15,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:15,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:15,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:23,827 INFO  L134       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:23,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:23,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877982409]
[2024-06-20 20:00:23,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877982409] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:23,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:23,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:00:23,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365942214]
[2024-06-20 20:00:23,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:23,828 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:00:23,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:23,828 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:00:23,828 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:00:24,034 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 20:00:24,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 422 transitions, 7170 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:24,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:24,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 20:00:24,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:25,908 INFO  L124   PetriNetUnfolderBase]: 3068/4716 cut-off events.
[2024-06-20 20:00:25,908 INFO  L125   PetriNetUnfolderBase]: For 261295/261555 co-relation queries the response was YES.
[2024-06-20 20:00:25,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40259 conditions, 4716 events. 3068/4716 cut-off events. For 261295/261555 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25495 event pairs, 555 based on Foata normal form. 61/4658 useless extension candidates. Maximal degree in co-relation 40134. Up to 3971 conditions per place. 
[2024-06-20 20:00:25,961 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 221 selfloop transitions, 135 changer transitions 0/449 dead transitions.
[2024-06-20 20:00:25,961 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 449 transitions, 8042 flow
[2024-06-20 20:00:25,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:00:25,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:00:25,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-20 20:00:25,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.428125
[2024-06-20 20:00:25,963 INFO  L175             Difference]: Start difference. First operand has 272 places, 422 transitions, 7170 flow. Second operand 8 states and 137 transitions.
[2024-06-20 20:00:25,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 449 transitions, 8042 flow
[2024-06-20 20:00:26,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 449 transitions, 7915 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-20 20:00:26,350 INFO  L231             Difference]: Finished difference. Result has 273 places, 424 transitions, 7375 flow
[2024-06-20 20:00:26,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7043, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7375, PETRI_PLACES=273, PETRI_TRANSITIONS=424}
[2024-06-20 20:00:26,351 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places.
[2024-06-20 20:00:26,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 424 transitions, 7375 flow
[2024-06-20 20:00:26,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:26,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:26,351 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:00:26,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 20:00:26,352 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:26,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:26,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945962152, now seen corresponding path program 1 times
[2024-06-20 20:00:26,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:26,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007902840]
[2024-06-20 20:00:26,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:26,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:26,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:34,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:00:34,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:34,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007902840]
[2024-06-20 20:00:34,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007902840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:34,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:34,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:00:34,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277181922]
[2024-06-20 20:00:34,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:34,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:00:34,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:34,980 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:00:34,980 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:00:35,176 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:35,176 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 424 transitions, 7375 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:35,176 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:35,177 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:35,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:37,175 INFO  L124   PetriNetUnfolderBase]: 3379/5110 cut-off events.
[2024-06-20 20:00:37,175 INFO  L125   PetriNetUnfolderBase]: For 257314/257324 co-relation queries the response was YES.
[2024-06-20 20:00:37,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43112 conditions, 5110 events. 3379/5110 cut-off events. For 257314/257324 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 27379 event pairs, 915 based on Foata normal form. 14/5123 useless extension candidates. Maximal degree in co-relation 42986. Up to 4831 conditions per place. 
[2024-06-20 20:00:37,230 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 407 selfloop transitions, 62 changer transitions 0/472 dead transitions.
[2024-06-20 20:00:37,230 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 472 transitions, 8602 flow
[2024-06-20 20:00:37,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:00:37,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:00:37,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions.
[2024-06-20 20:00:37,233 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4025
[2024-06-20 20:00:37,233 INFO  L175             Difference]: Start difference. First operand has 273 places, 424 transitions, 7375 flow. Second operand 10 states and 161 transitions.
[2024-06-20 20:00:37,233 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 472 transitions, 8602 flow
[2024-06-20 20:00:37,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 472 transitions, 8290 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-20 20:00:37,621 INFO  L231             Difference]: Finished difference. Result has 279 places, 434 transitions, 7372 flow
[2024-06-20 20:00:37,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7063, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7372, PETRI_PLACES=279, PETRI_TRANSITIONS=434}
[2024-06-20 20:00:37,621 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places.
[2024-06-20 20:00:37,621 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 434 transitions, 7372 flow
[2024-06-20 20:00:37,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:37,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:37,622 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:00:37,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 20:00:37,622 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:37,622 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:37,622 INFO  L85        PathProgramCache]: Analyzing trace with hash 1783537792, now seen corresponding path program 2 times
[2024-06-20 20:00:37,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:37,622 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487007248]
[2024-06-20 20:00:37,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:37,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:37,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:46,426 INFO  L134       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:46,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:46,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487007248]
[2024-06-20 20:00:46,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487007248] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:46,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:46,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:00:46,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033532383]
[2024-06-20 20:00:46,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:46,427 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:00:46,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:46,427 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:00:46,427 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:00:46,605 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:46,605 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 434 transitions, 7372 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:46,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:46,606 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:46,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:48,568 INFO  L124   PetriNetUnfolderBase]: 3407/5158 cut-off events.
[2024-06-20 20:00:48,568 INFO  L125   PetriNetUnfolderBase]: For 268638/268648 co-relation queries the response was YES.
[2024-06-20 20:00:48,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43610 conditions, 5158 events. 3407/5158 cut-off events. For 268638/268648 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 27634 event pairs, 679 based on Foata normal form. 14/5171 useless extension candidates. Maximal degree in co-relation 43481. Up to 4790 conditions per place. 
[2024-06-20 20:00:48,620 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 416 selfloop transitions, 68 changer transitions 0/487 dead transitions.
[2024-06-20 20:00:48,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 487 transitions, 8750 flow
[2024-06-20 20:00:48,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:00:48,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:00:48,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions.
[2024-06-20 20:00:48,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3975
[2024-06-20 20:00:48,623 INFO  L175             Difference]: Start difference. First operand has 279 places, 434 transitions, 7372 flow. Second operand 10 states and 159 transitions.
[2024-06-20 20:00:48,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 487 transitions, 8750 flow
[2024-06-20 20:00:49,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 487 transitions, 8546 flow, removed 70 selfloop flow, removed 5 redundant places.
[2024-06-20 20:00:49,055 INFO  L231             Difference]: Finished difference. Result has 287 places, 449 transitions, 7631 flow
[2024-06-20 20:00:49,056 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7238, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7631, PETRI_PLACES=287, PETRI_TRANSITIONS=449}
[2024-06-20 20:00:49,056 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 246 predicate places.
[2024-06-20 20:00:49,056 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 449 transitions, 7631 flow
[2024-06-20 20:00:49,056 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:49,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:49,057 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:00:49,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 20:00:49,057 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:49,057 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:49,057 INFO  L85        PathProgramCache]: Analyzing trace with hash 1805163170, now seen corresponding path program 3 times
[2024-06-20 20:00:49,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:49,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120751030]
[2024-06-20 20:00:49,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:49,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:49,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:57,338 INFO  L134       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,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:57,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120751030]
[2024-06-20 20:00:57,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120751030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:57,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:57,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:00:57,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243849121]
[2024-06-20 20:00:57,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:57,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:00:57,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:57,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:00:57,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:00:57,592 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:57,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 449 transitions, 7631 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:57,593 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:57,593 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:57,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:59,611 INFO  L124   PetriNetUnfolderBase]: 3424/5188 cut-off events.
[2024-06-20 20:00:59,612 INFO  L125   PetriNetUnfolderBase]: For 271950/271958 co-relation queries the response was YES.
[2024-06-20 20:00:59,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44287 conditions, 5188 events. 3424/5188 cut-off events. For 271950/271958 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27849 event pairs, 865 based on Foata normal form. 12/5199 useless extension candidates. Maximal degree in co-relation 44153. Up to 4868 conditions per place. 
[2024-06-20 20:00:59,662 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 395 selfloop transitions, 90 changer transitions 0/488 dead transitions.
[2024-06-20 20:00:59,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 488 transitions, 8807 flow
[2024-06-20 20:00:59,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:00:59,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:00:59,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions.
[2024-06-20 20:00:59,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.405
[2024-06-20 20:00:59,665 INFO  L175             Difference]: Start difference. First operand has 287 places, 449 transitions, 7631 flow. Second operand 10 states and 162 transitions.
[2024-06-20 20:00:59,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 488 transitions, 8807 flow
[2024-06-20 20:01:00,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 488 transitions, 8671 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-20 20:01:00,165 INFO  L231             Difference]: Finished difference. Result has 293 places, 451 transitions, 7745 flow
[2024-06-20 20:01:00,165 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7495, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7745, PETRI_PLACES=293, PETRI_TRANSITIONS=451}
[2024-06-20 20:01:00,165 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 252 predicate places.
[2024-06-20 20:01:00,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 293 places, 451 transitions, 7745 flow
[2024-06-20 20:01:00,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:00,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:00,166 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:01:00,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 20:01:00,166 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:01:00,166 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:00,166 INFO  L85        PathProgramCache]: Analyzing trace with hash 1806168500, now seen corresponding path program 4 times
[2024-06-20 20:01:00,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:00,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353228589]
[2024-06-20 20:01:00,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:00,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:00,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:08,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:08,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:08,697 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353228589]
[2024-06-20 20:01:08,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353228589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:08,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:08,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:08,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101427728]
[2024-06-20 20:01:08,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:08,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:08,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:08,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:08,698 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:08,983 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:08,983 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 451 transitions, 7745 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:08,983 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:08,983 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:08,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:11,105 INFO  L124   PetriNetUnfolderBase]: 3441/5211 cut-off events.
[2024-06-20 20:01:11,105 INFO  L125   PetriNetUnfolderBase]: For 285148/285156 co-relation queries the response was YES.
[2024-06-20 20:01:11,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44916 conditions, 5211 events. 3441/5211 cut-off events. For 285148/285156 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 27989 event pairs, 856 based on Foata normal form. 12/5222 useless extension candidates. Maximal degree in co-relation 44780. Up to 4824 conditions per place. 
[2024-06-20 20:01:11,155 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 401 selfloop transitions, 89 changer transitions 0/493 dead transitions.
[2024-06-20 20:01:11,156 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 493 transitions, 8969 flow
[2024-06-20 20:01:11,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:11,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:11,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions.
[2024-06-20 20:01:11,158 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4075
[2024-06-20 20:01:11,158 INFO  L175             Difference]: Start difference. First operand has 293 places, 451 transitions, 7745 flow. Second operand 10 states and 163 transitions.
[2024-06-20 20:01:11,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 493 transitions, 8969 flow
[2024-06-20 20:01:11,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 493 transitions, 8768 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:11,733 INFO  L231             Difference]: Finished difference. Result has 297 places, 456 transitions, 7851 flow
[2024-06-20 20:01:11,734 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7544, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7851, PETRI_PLACES=297, PETRI_TRANSITIONS=456}
[2024-06-20 20:01:11,734 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 256 predicate places.
[2024-06-20 20:01:11,734 INFO  L495      AbstractCegarLoop]: Abstraction has has 297 places, 456 transitions, 7851 flow
[2024-06-20 20:01:11,734 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:11,734 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:11,734 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:01:11,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 20:01:11,734 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:11,735 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:11,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -1860862984, now seen corresponding path program 5 times
[2024-06-20 20:01:11,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:11,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023412653]
[2024-06-20 20:01:11,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:11,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:11,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:19,915 INFO  L134       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,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:19,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023412653]
[2024-06-20 20:01:19,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023412653] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:19,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:19,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:19,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724383921]
[2024-06-20 20:01:19,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:19,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:19,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:19,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:19,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:20,149 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:20,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 456 transitions, 7851 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:20,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:20,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:20,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:22,241 INFO  L124   PetriNetUnfolderBase]: 3480/5265 cut-off events.
[2024-06-20 20:01:22,241 INFO  L125   PetriNetUnfolderBase]: For 298439/298449 co-relation queries the response was YES.
[2024-06-20 20:01:22,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45610 conditions, 5265 events. 3480/5265 cut-off events. For 298439/298449 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 28343 event pairs, 651 based on Foata normal form. 14/5278 useless extension candidates. Maximal degree in co-relation 45472. Up to 4976 conditions per place. 
[2024-06-20 20:01:22,307 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 434 selfloop transitions, 68 changer transitions 0/505 dead transitions.
[2024-06-20 20:01:22,307 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 505 transitions, 9150 flow
[2024-06-20 20:01:22,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:22,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:22,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions.
[2024-06-20 20:01:22,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.405
[2024-06-20 20:01:22,310 INFO  L175             Difference]: Start difference. First operand has 297 places, 456 transitions, 7851 flow. Second operand 10 states and 162 transitions.
[2024-06-20 20:01:22,310 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 505 transitions, 9150 flow
[2024-06-20 20:01:22,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 505 transitions, 8978 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-20 20:01:22,975 INFO  L231             Difference]: Finished difference. Result has 303 places, 469 transitions, 8030 flow
[2024-06-20 20:01:22,975 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7679, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8030, PETRI_PLACES=303, PETRI_TRANSITIONS=469}
[2024-06-20 20:01:22,975 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places.
[2024-06-20 20:01:22,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 303 places, 469 transitions, 8030 flow
[2024-06-20 20:01:22,976 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:22,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:22,976 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:01:22,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 20:01:22,976 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:22,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:22,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -1858985314, now seen corresponding path program 6 times
[2024-06-20 20:01:22,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:22,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105272794]
[2024-06-20 20:01:22,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:22,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:23,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:31,149 INFO  L134       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:31,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:31,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105272794]
[2024-06-20 20:01:31,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105272794] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:31,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:31,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:31,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819752208]
[2024-06-20 20:01:31,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:31,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:31,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:31,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:31,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:31,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:31,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 469 transitions, 8030 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:31,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:31,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:31,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:33,645 INFO  L124   PetriNetUnfolderBase]: 3508/5311 cut-off events.
[2024-06-20 20:01:33,645 INFO  L125   PetriNetUnfolderBase]: For 308884/308894 co-relation queries the response was YES.
[2024-06-20 20:01:33,676 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46431 conditions, 5311 events. 3508/5311 cut-off events. For 308884/308894 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 28576 event pairs, 685 based on Foata normal form. 14/5324 useless extension candidates. Maximal degree in co-relation 46289. Up to 4993 conditions per place. 
[2024-06-20 20:01:33,696 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 415 selfloop transitions, 90 changer transitions 0/508 dead transitions.
[2024-06-20 20:01:33,696 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 508 transitions, 9260 flow
[2024-06-20 20:01:33,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:33,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:33,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions.
[2024-06-20 20:01:33,698 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4075
[2024-06-20 20:01:33,698 INFO  L175             Difference]: Start difference. First operand has 303 places, 469 transitions, 8030 flow. Second operand 10 states and 163 transitions.
[2024-06-20 20:01:33,698 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 508 transitions, 9260 flow
[2024-06-20 20:01:34,371 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 508 transitions, 9153 flow, removed 34 selfloop flow, removed 4 redundant places.
[2024-06-20 20:01:34,379 INFO  L231             Difference]: Finished difference. Result has 309 places, 473 transitions, 8205 flow
[2024-06-20 20:01:34,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7923, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8205, PETRI_PLACES=309, PETRI_TRANSITIONS=473}
[2024-06-20 20:01:34,380 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 268 predicate places.
[2024-06-20 20:01:34,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 473 transitions, 8205 flow
[2024-06-20 20:01:34,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:34,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:34,380 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:01:34,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 20:01:34,381 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:34,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:34,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 888080940, now seen corresponding path program 7 times
[2024-06-20 20:01:34,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:34,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608446162]
[2024-06-20 20:01:34,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:34,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:34,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:42,354 INFO  L134       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:42,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:42,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608446162]
[2024-06-20 20:01:42,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608446162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:42,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:42,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:42,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923157821]
[2024-06-20 20:01:42,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:42,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:42,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:42,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:42,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:42,611 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:42,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 473 transitions, 8205 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:42,612 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:42,612 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:42,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:44,816 INFO  L124   PetriNetUnfolderBase]: 3536/5353 cut-off events.
[2024-06-20 20:01:44,817 INFO  L125   PetriNetUnfolderBase]: For 322516/322526 co-relation queries the response was YES.
[2024-06-20 20:01:44,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47288 conditions, 5353 events. 3536/5353 cut-off events. For 322516/322526 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28879 event pairs, 684 based on Foata normal form. 14/5366 useless extension candidates. Maximal degree in co-relation 47144. Up to 4959 conditions per place. 
[2024-06-20 20:01:44,874 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 420 selfloop transitions, 92 changer transitions 0/515 dead transitions.
[2024-06-20 20:01:44,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 515 transitions, 9488 flow
[2024-06-20 20:01:44,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:44,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:44,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions.
[2024-06-20 20:01:44,877 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41
[2024-06-20 20:01:44,877 INFO  L175             Difference]: Start difference. First operand has 309 places, 473 transitions, 8205 flow. Second operand 10 states and 164 transitions.
[2024-06-20 20:01:44,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 515 transitions, 9488 flow
[2024-06-20 20:01:45,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 515 transitions, 9262 flow, removed 28 selfloop flow, removed 8 redundant places.
[2024-06-20 20:01:45,567 INFO  L231             Difference]: Finished difference. Result has 312 places, 480 transitions, 8328 flow
[2024-06-20 20:01:45,568 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7979, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8328, PETRI_PLACES=312, PETRI_TRANSITIONS=480}
[2024-06-20 20:01:45,568 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 271 predicate places.
[2024-06-20 20:01:45,568 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 480 transitions, 8328 flow
[2024-06-20 20:01:45,568 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:45,568 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:45,568 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:01:45,568 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 20:01:45,568 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:45,569 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:45,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801732766, now seen corresponding path program 8 times
[2024-06-20 20:01:45,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:45,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776002735]
[2024-06-20 20:01:45,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:45,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:45,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:54,068 INFO  L134       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:54,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:54,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776002735]
[2024-06-20 20:01:54,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776002735] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:54,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:54,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:54,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566406306]
[2024-06-20 20:01:54,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:54,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:54,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:54,070 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:54,070 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:54,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:01:54,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 480 transitions, 8328 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:54,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:54,344 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:01:54,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:56,723 INFO  L124   PetriNetUnfolderBase]: 3553/5383 cut-off events.
[2024-06-20 20:01:56,723 INFO  L125   PetriNetUnfolderBase]: For 337705/337711 co-relation queries the response was YES.
[2024-06-20 20:01:56,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47904 conditions, 5383 events. 3553/5383 cut-off events. For 337705/337711 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29028 event pairs, 671 based on Foata normal form. 10/5392 useless extension candidates. Maximal degree in co-relation 47758. Up to 4722 conditions per place. 
[2024-06-20 20:01:56,780 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 380 selfloop transitions, 135 changer transitions 0/518 dead transitions.
[2024-06-20 20:01:56,780 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 518 transitions, 9584 flow
[2024-06-20 20:01:56,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:01:56,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:01:56,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-20 20:01:56,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175
[2024-06-20 20:01:56,782 INFO  L175             Difference]: Start difference. First operand has 312 places, 480 transitions, 8328 flow. Second operand 10 states and 167 transitions.
[2024-06-20 20:01:56,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 518 transitions, 9584 flow
[2024-06-20 20:01:57,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 518 transitions, 9422 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-20 20:01:57,523 INFO  L231             Difference]: Finished difference. Result has 317 places, 482 transitions, 8522 flow
[2024-06-20 20:01:57,524 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8166, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8522, PETRI_PLACES=317, PETRI_TRANSITIONS=482}
[2024-06-20 20:01:57,524 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places.
[2024-06-20 20:01:57,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 482 transitions, 8522 flow
[2024-06-20 20:01:57,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:57,524 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:57,524 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:01:57,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 20:01:57,524 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:57,525 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:57,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801729046, now seen corresponding path program 9 times
[2024-06-20 20:01:57,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:57,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792445725]
[2024-06-20 20:01:57,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:57,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:57,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:05,899 INFO  L134       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:05,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:05,899 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792445725]
[2024-06-20 20:02:05,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792445725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:05,899 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:05,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:02:05,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80932471]
[2024-06-20 20:02:05,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:05,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:02:05,900 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:05,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:02:05,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:02:06,100 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:06,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 482 transitions, 8522 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:06,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:06,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:06,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:08,398 INFO  L124   PetriNetUnfolderBase]: 3706/5629 cut-off events.
[2024-06-20 20:02:08,398 INFO  L125   PetriNetUnfolderBase]: For 387702/387708 co-relation queries the response was YES.
[2024-06-20 20:02:08,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51594 conditions, 5629 events. 3706/5629 cut-off events. For 387702/387708 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30783 event pairs, 721 based on Foata normal form. 10/5638 useless extension candidates. Maximal degree in co-relation 51446. Up to 4723 conditions per place. 
[2024-06-20 20:02:08,629 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 388 selfloop transitions, 138 changer transitions 0/529 dead transitions.
[2024-06-20 20:02:08,630 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 529 transitions, 10128 flow
[2024-06-20 20:02:08,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:08,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:08,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-20 20:02:08,632 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-20 20:02:08,632 INFO  L175             Difference]: Start difference. First operand has 317 places, 482 transitions, 8522 flow. Second operand 10 states and 173 transitions.
[2024-06-20 20:02:08,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 529 transitions, 10128 flow
[2024-06-20 20:02:09,438 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 529 transitions, 9792 flow, removed 35 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:09,446 INFO  L231             Difference]: Finished difference. Result has 320 places, 487 transitions, 8652 flow
[2024-06-20 20:02:09,446 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8186, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8652, PETRI_PLACES=320, PETRI_TRANSITIONS=487}
[2024-06-20 20:02:09,446 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places.
[2024-06-20 20:02:09,446 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 487 transitions, 8652 flow
[2024-06-20 20:02:09,447 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:09,447 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:09,447 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:09,447 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 20:02:09,447 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:09,447 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:09,447 INFO  L85        PathProgramCache]: Analyzing trace with hash 1807239296, now seen corresponding path program 10 times
[2024-06-20 20:02:09,447 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:09,447 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784839678]
[2024-06-20 20:02:09,448 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:09,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:09,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:17,681 INFO  L134       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:17,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:17,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784839678]
[2024-06-20 20:02:17,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784839678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:17,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:17,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:02:17,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235642724]
[2024-06-20 20:02:17,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:17,682 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:02:17,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:17,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:02:17,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:02:17,802 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:17,802 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 487 transitions, 8652 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:17,802 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:17,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:17,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:20,176 INFO  L124   PetriNetUnfolderBase]: 3662/5561 cut-off events.
[2024-06-20 20:02:20,176 INFO  L125   PetriNetUnfolderBase]: For 393884/393890 co-relation queries the response was YES.
[2024-06-20 20:02:20,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50144 conditions, 5561 events. 3662/5561 cut-off events. For 393884/393890 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30344 event pairs, 681 based on Foata normal form. 30/5590 useless extension candidates. Maximal degree in co-relation 49994. Up to 4772 conditions per place. 
[2024-06-20 20:02:20,244 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 382 selfloop transitions, 143 changer transitions 0/528 dead transitions.
[2024-06-20 20:02:20,245 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 528 transitions, 9925 flow
[2024-06-20 20:02:20,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:20,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:20,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions.
[2024-06-20 20:02:20,247 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 20:02:20,247 INFO  L175             Difference]: Start difference. First operand has 320 places, 487 transitions, 8652 flow. Second operand 10 states and 170 transitions.
[2024-06-20 20:02:20,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 528 transitions, 9925 flow
[2024-06-20 20:02:21,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 528 transitions, 9605 flow, removed 79 selfloop flow, removed 6 redundant places.
[2024-06-20 20:02:21,163 INFO  L231             Difference]: Finished difference. Result has 324 places, 488 transitions, 8667 flow
[2024-06-20 20:02:21,164 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8356, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8667, PETRI_PLACES=324, PETRI_TRANSITIONS=488}
[2024-06-20 20:02:21,164 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places.
[2024-06-20 20:02:21,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 324 places, 488 transitions, 8667 flow
[2024-06-20 20:02:21,164 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:21,165 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:21,165 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:21,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 20:02:21,165 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:21,165 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:21,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 1807454498, now seen corresponding path program 1 times
[2024-06-20 20:02:21,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:21,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854878506]
[2024-06-20 20:02:21,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:21,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:21,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:29,006 INFO  L134       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:29,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:29,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854878506]
[2024-06-20 20:02:29,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854878506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:29,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:29,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:02:29,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022237669]
[2024-06-20 20:02:29,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:29,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:02:29,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:29,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:02:29,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:02:29,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:29,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 488 transitions, 8667 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:29,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:29,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:29,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:31,848 INFO  L124   PetriNetUnfolderBase]: 3781/5762 cut-off events.
[2024-06-20 20:02:31,848 INFO  L125   PetriNetUnfolderBase]: For 408097/408103 co-relation queries the response was YES.
[2024-06-20 20:02:31,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51850 conditions, 5762 events. 3781/5762 cut-off events. For 408097/408103 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 31739 event pairs, 704 based on Foata normal form. 22/5783 useless extension candidates. Maximal degree in co-relation 51698. Up to 4508 conditions per place. 
[2024-06-20 20:02:31,908 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 388 selfloop transitions, 144 changer transitions 0/535 dead transitions.
[2024-06-20 20:02:31,909 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 535 transitions, 10229 flow
[2024-06-20 20:02:31,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:31,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:31,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-20 20:02:31,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-20 20:02:31,911 INFO  L175             Difference]: Start difference. First operand has 324 places, 488 transitions, 8667 flow. Second operand 10 states and 173 transitions.
[2024-06-20 20:02:31,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 535 transitions, 10229 flow
[2024-06-20 20:02:32,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 535 transitions, 9947 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:32,684 INFO  L231             Difference]: Finished difference. Result has 326 places, 490 transitions, 8749 flow
[2024-06-20 20:02:32,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8385, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8749, PETRI_PLACES=326, PETRI_TRANSITIONS=490}
[2024-06-20 20:02:32,685 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 285 predicate places.
[2024-06-20 20:02:32,685 INFO  L495      AbstractCegarLoop]: Abstraction has has 326 places, 490 transitions, 8749 flow
[2024-06-20 20:02:32,685 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:32,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:32,685 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:32,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 20:02:32,686 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:02:32,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:32,686 INFO  L85        PathProgramCache]: Analyzing trace with hash 1073613691, now seen corresponding path program 1 times
[2024-06-20 20:02:32,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:32,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725148824]
[2024-06-20 20:02:32,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:32,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:32,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:45,910 INFO  L134       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,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:45,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725148824]
[2024-06-20 20:02:45,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725148824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:45,910 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:45,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:02:45,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067078917]
[2024-06-20 20:02:45,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:45,911 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:02:45,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:45,911 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:02:45,911 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:02:46,011 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:46,011 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 490 transitions, 8749 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:02:46,011 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:46,012 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:46,012 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:48,358 INFO  L124   PetriNetUnfolderBase]: 3791/5778 cut-off events.
[2024-06-20 20:02:48,358 INFO  L125   PetriNetUnfolderBase]: For 404077/404085 co-relation queries the response was YES.
[2024-06-20 20:02:48,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52269 conditions, 5778 events. 3791/5778 cut-off events. For 404077/404085 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 32063 event pairs, 1117 based on Foata normal form. 10/5787 useless extension candidates. Maximal degree in co-relation 52116. Up to 5679 conditions per place. 
[2024-06-20 20:02:48,423 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 484 selfloop transitions, 31 changer transitions 0/518 dead transitions.
[2024-06-20 20:02:48,423 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 518 transitions, 10035 flow
[2024-06-20 20:02:48,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:02:48,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:02:48,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-20 20:02:48,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 20:02:48,425 INFO  L175             Difference]: Start difference. First operand has 326 places, 490 transitions, 8749 flow. Second operand 8 states and 128 transitions.
[2024-06-20 20:02:48,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 518 transitions, 10035 flow
[2024-06-20 20:02:49,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 518 transitions, 9775 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 20:02:49,351 INFO  L231             Difference]: Finished difference. Result has 327 places, 496 transitions, 8639 flow
[2024-06-20 20:02:49,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8489, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8639, PETRI_PLACES=327, PETRI_TRANSITIONS=496}
[2024-06-20 20:02:49,351 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places.
[2024-06-20 20:02:49,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 496 transitions, 8639 flow
[2024-06-20 20:02:49,351 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:02:49,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:49,352 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:49,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 20:02:49,352 INFO  L420      AbstractCegarLoop]: === Iteration 71 === 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:49,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:49,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1203394056, now seen corresponding path program 11 times
[2024-06-20 20:02:49,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:49,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810676174]
[2024-06-20 20:02:49,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:49,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:49,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:57,325 INFO  L134       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:57,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:57,328 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810676174]
[2024-06-20 20:02:57,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810676174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:57,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:57,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:02:57,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830911067]
[2024-06-20 20:02:57,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:57,329 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:02:57,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:57,329 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:02:57,330 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:02:57,576 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:02:57,576 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 496 transitions, 8639 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:57,576 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:57,576 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:02:57,576 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:00,130 INFO  L124   PetriNetUnfolderBase]: 3808/5805 cut-off events.
[2024-06-20 20:03:00,131 INFO  L125   PetriNetUnfolderBase]: For 419178/419188 co-relation queries the response was YES.
[2024-06-20 20:03:00,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52673 conditions, 5805 events. 3808/5805 cut-off events. For 419178/419188 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 32142 event pairs, 810 based on Foata normal form. 14/5818 useless extension candidates. Maximal degree in co-relation 52518. Up to 5270 conditions per place. 
[2024-06-20 20:03:00,196 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 442 selfloop transitions, 88 changer transitions 0/533 dead transitions.
[2024-06-20 20:03:00,197 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 533 transitions, 9961 flow
[2024-06-20 20:03:00,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:03:00,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:03:00,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-20 20:03:00,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 20:03:00,199 INFO  L175             Difference]: Start difference. First operand has 327 places, 496 transitions, 8639 flow. Second operand 9 states and 144 transitions.
[2024-06-20 20:03:00,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 533 transitions, 9961 flow
[2024-06-20 20:03:01,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 533 transitions, 9840 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-20 20:03:01,040 INFO  L231             Difference]: Finished difference. Result has 331 places, 500 transitions, 8876 flow
[2024-06-20 20:03:01,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8518, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8876, PETRI_PLACES=331, PETRI_TRANSITIONS=500}
[2024-06-20 20:03:01,041 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places.
[2024-06-20 20:03:01,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 331 places, 500 transitions, 8876 flow
[2024-06-20 20:03:01,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:01,041 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:01,041 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:01,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 20:03:01,042 INFO  L420      AbstractCegarLoop]: === Iteration 72 === 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:01,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:01,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -1832809590, now seen corresponding path program 12 times
[2024-06-20 20:03:01,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:01,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602420355]
[2024-06-20 20:03:01,042 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:01,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:01,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:09,320 INFO  L134       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:09,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:09,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602420355]
[2024-06-20 20:03:09,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602420355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:09,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:09,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:03:09,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87423958]
[2024-06-20 20:03:09,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:09,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:03:09,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:09,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:03:09,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:03:09,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:09,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 500 transitions, 8876 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:09,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:09,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:09,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:12,192 INFO  L124   PetriNetUnfolderBase]: 3850/5876 cut-off events.
[2024-06-20 20:03:12,192 INFO  L125   PetriNetUnfolderBase]: For 441309/441317 co-relation queries the response was YES.
[2024-06-20 20:03:12,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54567 conditions, 5876 events. 3850/5876 cut-off events. For 441309/441317 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 32810 event pairs, 957 based on Foata normal form. 12/5887 useless extension candidates. Maximal degree in co-relation 54411. Up to 5166 conditions per place. 
[2024-06-20 20:03:12,254 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 408 selfloop transitions, 129 changer transitions 0/540 dead transitions.
[2024-06-20 20:03:12,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 540 transitions, 10496 flow
[2024-06-20 20:03:12,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:03:12,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:03:12,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 20:03:12,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 20:03:12,256 INFO  L175             Difference]: Start difference. First operand has 331 places, 500 transitions, 8876 flow. Second operand 9 states and 149 transitions.
[2024-06-20 20:03:12,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 540 transitions, 10496 flow
[2024-06-20 20:03:13,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 540 transitions, 10267 flow, removed 78 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:13,293 INFO  L231             Difference]: Finished difference. Result has 336 places, 505 transitions, 9162 flow
[2024-06-20 20:03:13,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8683, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9162, PETRI_PLACES=336, PETRI_TRANSITIONS=505}
[2024-06-20 20:03:13,294 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 295 predicate places.
[2024-06-20 20:03:13,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 336 places, 505 transitions, 9162 flow
[2024-06-20 20:03:13,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:13,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:13,294 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,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-20 20:03:13,294 INFO  L420      AbstractCegarLoop]: === Iteration 73 === 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,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:13,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -1832805870, now seen corresponding path program 13 times
[2024-06-20 20:03:13,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:13,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091537035]
[2024-06-20 20:03:13,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:13,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:13,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:21,902 INFO  L134       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:21,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:21,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091537035]
[2024-06-20 20:03:21,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091537035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:21,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:21,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:03:21,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810895557]
[2024-06-20 20:03:21,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:21,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:03:21,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:21,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:03:21,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:03:22,094 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:22,095 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 505 transitions, 9162 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:22,095 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:22,095 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:22,095 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:24,749 INFO  L124   PetriNetUnfolderBase]: 3842/5868 cut-off events.
[2024-06-20 20:03:24,749 INFO  L125   PetriNetUnfolderBase]: For 404086/404094 co-relation queries the response was YES.
[2024-06-20 20:03:24,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53706 conditions, 5868 events. 3842/5868 cut-off events. For 404086/404094 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32791 event pairs, 977 based on Foata normal form. 12/5879 useless extension candidates. Maximal degree in co-relation 53547. Up to 5336 conditions per place. 
[2024-06-20 20:03:24,811 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 410 selfloop transitions, 126 changer transitions 0/539 dead transitions.
[2024-06-20 20:03:24,812 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 539 transitions, 10409 flow
[2024-06-20 20:03:24,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:03:24,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:03:24,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions.
[2024-06-20 20:03:24,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40555555555555556
[2024-06-20 20:03:24,814 INFO  L175             Difference]: Start difference. First operand has 336 places, 505 transitions, 9162 flow. Second operand 9 states and 146 transitions.
[2024-06-20 20:03:24,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 539 transitions, 10409 flow
[2024-06-20 20:03:26,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 539 transitions, 10143 flow, removed 71 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:26,095 INFO  L231             Difference]: Finished difference. Result has 340 places, 506 transitions, 9209 flow
[2024-06-20 20:03:26,096 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8916, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9209, PETRI_PLACES=340, PETRI_TRANSITIONS=506}
[2024-06-20 20:03:26,096 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places.
[2024-06-20 20:03:26,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 340 places, 506 transitions, 9209 flow
[2024-06-20 20:03:26,096 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:26,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:26,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:26,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-20 20:03:26,096 INFO  L420      AbstractCegarLoop]: === Iteration 74 === 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:26,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:26,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 1833418740, now seen corresponding path program 14 times
[2024-06-20 20:03:26,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:26,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467665785]
[2024-06-20 20:03:26,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:26,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:26,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:33,834 INFO  L134       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:33,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:33,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467665785]
[2024-06-20 20:03:33,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467665785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:33,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:33,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:03:33,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698839271]
[2024-06-20 20:03:33,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:33,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:03:33,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:33,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:03:33,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:03:34,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:34,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 506 transitions, 9209 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:34,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:34,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:34,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:36,640 INFO  L124   PetriNetUnfolderBase]: 3934/6009 cut-off events.
[2024-06-20 20:03:36,640 INFO  L125   PetriNetUnfolderBase]: For 444820/444826 co-relation queries the response was YES.
[2024-06-20 20:03:36,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55024 conditions, 6009 events. 3934/6009 cut-off events. For 444820/444826 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 33647 event pairs, 730 based on Foata normal form. 30/6038 useless extension candidates. Maximal degree in co-relation 54863. Up to 4871 conditions per place. 
[2024-06-20 20:03:36,710 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 371 selfloop transitions, 170 changer transitions 0/544 dead transitions.
[2024-06-20 20:03:36,710 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 544 transitions, 10547 flow
[2024-06-20 20:03:36,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:03:36,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:03:36,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 20:03:36,712 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 20:03:36,712 INFO  L175             Difference]: Start difference. First operand has 340 places, 506 transitions, 9209 flow. Second operand 9 states and 153 transitions.
[2024-06-20 20:03:36,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 544 transitions, 10547 flow
[2024-06-20 20:03:37,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 544 transitions, 10315 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-20 20:03:37,725 INFO  L231             Difference]: Finished difference. Result has 342 places, 508 transitions, 9418 flow
[2024-06-20 20:03:37,725 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8977, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9418, PETRI_PLACES=342, PETRI_TRANSITIONS=508}
[2024-06-20 20:03:37,725 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 301 predicate places.
[2024-06-20 20:03:37,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 508 transitions, 9418 flow
[2024-06-20 20:03:37,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:37,726 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:37,726 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:37,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-20 20:03:37,726 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:03:37,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:37,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 576744242, now seen corresponding path program 2 times
[2024-06-20 20:03:37,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:37,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749850229]
[2024-06-20 20:03:37,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:37,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:37,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:44,957 INFO  L134       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:44,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:44,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749850229]
[2024-06-20 20:03:44,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749850229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:44,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:44,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:03:44,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399553248]
[2024-06-20 20:03:44,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:44,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:03:44,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:44,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:03:44,958 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:03:45,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:45,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 508 transitions, 9418 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:45,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:45,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:45,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:47,879 INFO  L124   PetriNetUnfolderBase]: 4078/6249 cut-off events.
[2024-06-20 20:03:47,879 INFO  L125   PetriNetUnfolderBase]: For 482184/482190 co-relation queries the response was YES.
[2024-06-20 20:03:47,929 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58349 conditions, 6249 events. 4078/6249 cut-off events. For 482184/482190 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 35330 event pairs, 740 based on Foata normal form. 22/6270 useless extension candidates. Maximal degree in co-relation 58187. Up to 4250 conditions per place. 
[2024-06-20 20:03:48,152 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 361 selfloop transitions, 193 changer transitions 0/557 dead transitions.
[2024-06-20 20:03:48,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 557 transitions, 11098 flow
[2024-06-20 20:03:48,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:03:48,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:03:48,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions.
[2024-06-20 20:03:48,155 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4275
[2024-06-20 20:03:48,155 INFO  L175             Difference]: Start difference. First operand has 342 places, 508 transitions, 9418 flow. Second operand 10 states and 171 transitions.
[2024-06-20 20:03:48,155 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 557 transitions, 11098 flow
[2024-06-20 20:03:49,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 557 transitions, 10711 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-20 20:03:49,148 INFO  L231             Difference]: Finished difference. Result has 345 places, 510 transitions, 9499 flow
[2024-06-20 20:03:49,148 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9031, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9499, PETRI_PLACES=345, PETRI_TRANSITIONS=510}
[2024-06-20 20:03:49,148 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 304 predicate places.
[2024-06-20 20:03:49,148 INFO  L495      AbstractCegarLoop]: Abstraction has has 345 places, 510 transitions, 9499 flow
[2024-06-20 20:03:49,149 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:49,149 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:49,149 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,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-20 20:03:49,149 INFO  L420      AbstractCegarLoop]: === Iteration 76 === 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,149 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:49,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 1827912210, now seen corresponding path program 15 times
[2024-06-20 20:03:49,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:49,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852290128]
[2024-06-20 20:03:49,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:49,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:49,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:57,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:57,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:57,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852290128]
[2024-06-20 20:03:57,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852290128] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:57,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:57,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:03:57,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038743300]
[2024-06-20 20:03:57,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:57,643 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:03:57,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:57,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:03:57,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:03:57,883 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:03:57,883 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 510 transitions, 9499 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:57,883 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:57,883 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:03:57,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:00,683 INFO  L124   PetriNetUnfolderBase]: 4070/6237 cut-off events.
[2024-06-20 20:04:00,684 INFO  L125   PetriNetUnfolderBase]: For 467613/467619 co-relation queries the response was YES.
[2024-06-20 20:04:00,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58095 conditions, 6237 events. 4070/6237 cut-off events. For 467613/467619 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 35439 event pairs, 808 based on Foata normal form. 10/6246 useless extension candidates. Maximal degree in co-relation 57932. Up to 5348 conditions per place. 
[2024-06-20 20:04:00,765 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 380 selfloop transitions, 161 changer transitions 0/544 dead transitions.
[2024-06-20 20:04:00,765 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 544 transitions, 10807 flow
[2024-06-20 20:04:00,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:00,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:00,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 20:04:00,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 20:04:00,768 INFO  L175             Difference]: Start difference. First operand has 345 places, 510 transitions, 9499 flow. Second operand 9 states and 150 transitions.
[2024-06-20 20:04:00,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 544 transitions, 10807 flow
[2024-06-20 20:04:02,070 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 544 transitions, 10567 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-20 20:04:02,077 INFO  L231             Difference]: Finished difference. Result has 348 places, 512 transitions, 9682 flow
[2024-06-20 20:04:02,078 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9261, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9682, PETRI_PLACES=348, PETRI_TRANSITIONS=512}
[2024-06-20 20:04:02,078 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 307 predicate places.
[2024-06-20 20:04:02,078 INFO  L495      AbstractCegarLoop]: Abstraction has has 348 places, 512 transitions, 9682 flow
[2024-06-20 20:04:02,078 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:02,078 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:02,078 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:02,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-20 20:04:02,079 INFO  L420      AbstractCegarLoop]: === Iteration 77 === 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:02,079 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:02,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 571018790, now seen corresponding path program 16 times
[2024-06-20 20:04:02,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:02,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636615658]
[2024-06-20 20:04:02,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:02,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:02,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:11,198 INFO  L134       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:11,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:11,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636615658]
[2024-06-20 20:04:11,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636615658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:11,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:11,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:04:11,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22812455]
[2024-06-20 20:04:11,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:11,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:04:11,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:11,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:04:11,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:04:11,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:11,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 512 transitions, 9682 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:11,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:11,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:11,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:14,246 INFO  L124   PetriNetUnfolderBase]: 4087/6264 cut-off events.
[2024-06-20 20:04:14,246 INFO  L125   PetriNetUnfolderBase]: For 471494/471500 co-relation queries the response was YES.
[2024-06-20 20:04:14,301 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58801 conditions, 6264 events. 4087/6264 cut-off events. For 471494/471500 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 35623 event pairs, 807 based on Foata normal form. 10/6273 useless extension candidates. Maximal degree in co-relation 58637. Up to 5002 conditions per place. 
[2024-06-20 20:04:14,331 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 379 selfloop transitions, 170 changer transitions 0/552 dead transitions.
[2024-06-20 20:04:14,331 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 552 transitions, 11084 flow
[2024-06-20 20:04:14,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:14,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:14,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-20 20:04:14,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-20 20:04:14,334 INFO  L175             Difference]: Start difference. First operand has 348 places, 512 transitions, 9682 flow. Second operand 9 states and 154 transitions.
[2024-06-20 20:04:14,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 552 transitions, 11084 flow
[2024-06-20 20:04:15,424 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 552 transitions, 10697 flow, removed 36 selfloop flow, removed 7 redundant places.
[2024-06-20 20:04:15,432 INFO  L231             Difference]: Finished difference. Result has 351 places, 516 transitions, 9810 flow
[2024-06-20 20:04:15,432 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9297, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9810, PETRI_PLACES=351, PETRI_TRANSITIONS=516}
[2024-06-20 20:04:15,432 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 310 predicate places.
[2024-06-20 20:04:15,432 INFO  L495      AbstractCegarLoop]: Abstraction has has 351 places, 516 transitions, 9810 flow
[2024-06-20 20:04:15,432 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:15,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:15,433 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:15,433 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-20 20:04:15,433 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:04:15,433 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:15,433 INFO  L85        PathProgramCache]: Analyzing trace with hash 333522463, now seen corresponding path program 2 times
[2024-06-20 20:04:15,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:15,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686070675]
[2024-06-20 20:04:15,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:15,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:15,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:23,702 INFO  L134       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:23,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:23,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686070675]
[2024-06-20 20:04:23,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686070675] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:23,702 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:23,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:23,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411193324]
[2024-06-20 20:04:23,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:23,703 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:23,703 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:23,703 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:23,703 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:23,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:23,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 516 transitions, 9810 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:04:23,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:23,844 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:23,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:26,421 INFO  L124   PetriNetUnfolderBase]: 4102/6287 cut-off events.
[2024-06-20 20:04:26,421 INFO  L125   PetriNetUnfolderBase]: For 481119/481127 co-relation queries the response was YES.
[2024-06-20 20:04:26,478 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59212 conditions, 6287 events. 4102/6287 cut-off events. For 481119/481127 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35894 event pairs, 1196 based on Foata normal form. 10/6296 useless extension candidates. Maximal degree in co-relation 59046. Up to 6181 conditions per place. 
[2024-06-20 20:04:26,509 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 501 selfloop transitions, 36 changer transitions 0/540 dead transitions.
[2024-06-20 20:04:26,509 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 540 transitions, 11144 flow
[2024-06-20 20:04:26,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:04:26,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:04:26,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 20:04:26,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 20:04:26,512 INFO  L175             Difference]: Start difference. First operand has 351 places, 516 transitions, 9810 flow. Second operand 7 states and 113 transitions.
[2024-06-20 20:04:26,512 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 540 transitions, 11144 flow
[2024-06-20 20:04:27,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 540 transitions, 10846 flow, removed 54 selfloop flow, removed 6 redundant places.
[2024-06-20 20:04:27,502 INFO  L231             Difference]: Finished difference. Result has 353 places, 522 transitions, 9691 flow
[2024-06-20 20:04:27,503 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9514, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9691, PETRI_PLACES=353, PETRI_TRANSITIONS=522}
[2024-06-20 20:04:27,503 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places.
[2024-06-20 20:04:27,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 353 places, 522 transitions, 9691 flow
[2024-06-20 20:04:27,503 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:04:27,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:27,503 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:27,503 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-20 20:04:27,504 INFO  L420      AbstractCegarLoop]: === Iteration 79 === 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:27,504 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:27,504 INFO  L85        PathProgramCache]: Analyzing trace with hash 2093380824, now seen corresponding path program 17 times
[2024-06-20 20:04:27,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:27,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631236140]
[2024-06-20 20:04:27,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:27,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:27,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:36,414 INFO  L134       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:36,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:36,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631236140]
[2024-06-20 20:04:36,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631236140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:36,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:36,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:04:36,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522622490]
[2024-06-20 20:04:36,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:36,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:04:36,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:36,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:04:36,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:04:36,603 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:04:36,603 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 522 transitions, 9691 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:36,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:36,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:04:36,604 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:39,453 INFO  L124   PetriNetUnfolderBase]: 4119/6315 cut-off events.
[2024-06-20 20:04:39,453 INFO  L125   PetriNetUnfolderBase]: For 477986/477994 co-relation queries the response was YES.
[2024-06-20 20:04:39,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59187 conditions, 6315 events. 4119/6315 cut-off events. For 477986/477994 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 35947 event pairs, 801 based on Foata normal form. 12/6323 useless extension candidates. Maximal degree in co-relation 59019. Up to 5189 conditions per place. 
[2024-06-20 20:04:39,527 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 367 selfloop transitions, 185 changer transitions 0/555 dead transitions.
[2024-06-20 20:04:39,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 555 transitions, 11025 flow
[2024-06-20 20:04:39,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:39,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:39,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 20:04:39,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 20:04:39,529 INFO  L175             Difference]: Start difference. First operand has 353 places, 522 transitions, 9691 flow. Second operand 9 states and 153 transitions.
[2024-06-20 20:04:39,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 555 transitions, 11025 flow
[2024-06-20 20:04:40,444 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 555 transitions, 10950 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-20 20:04:40,452 INFO  L231             Difference]: Finished difference. Result has 358 places, 524 transitions, 10087 flow
[2024-06-20 20:04:40,452 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9616, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10087, PETRI_PLACES=358, PETRI_TRANSITIONS=524}
[2024-06-20 20:04:40,452 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 317 predicate places.
[2024-06-20 20:04:40,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 358 places, 524 transitions, 10087 flow
[2024-06-20 20:04:40,453 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:40,453 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:40,453 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:40,453 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-20 20:04:40,453 INFO  L420      AbstractCegarLoop]: === Iteration 80 === 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:40,453 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:40,453 INFO  L85        PathProgramCache]: Analyzing trace with hash -286512672, now seen corresponding path program 18 times
[2024-06-20 20:04:40,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:40,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888316097]
[2024-06-20 20:04:40,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:40,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:40,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15