./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.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/protection/safe025_rmo.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe025_rmo.i ./goblint.2024-05-21_14-57-05.files/protection/safe025_rmo.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-bcb38a6-m [2024-06-03 20:14:45,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:14:45,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:14:45,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:14:45,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:14:45,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:14:45,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:14:45,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:14:45,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:14:45,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:14:45,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:14:45,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:14:45,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:14:45,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:14:45,791 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:14:45,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:14:45,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:14:45,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:14:45,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:14:45,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:14:45,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:14:45,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:14:45,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:14:45,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:14:45,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:14:45,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:14:45,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:14:45,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:14:45,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:14:45,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:14:45,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:14:45,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:14:45,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:14:45,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:14:45,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:14:45,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:14:45,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:14:45,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:14:45,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:14:45,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:14:45,800 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:14:45,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:14:45,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:14:45,801 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-03 20:14:46,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:14:46,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:14:46,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:14:46,072 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:14:46,072 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:14:46,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe025_rmo.yml/witness.yml [2024-06-03 20:14:46,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:14:46,275 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:14:46,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2024-06-03 20:14:47,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:14:47,641 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:14:47,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2024-06-03 20:14:47,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ae548a6/b69a35c15bf44e52b16edeec20ae063f/FLAG9c34b9cca [2024-06-03 20:14:47,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ae548a6/b69a35c15bf44e52b16edeec20ae063f [2024-06-03 20:14:47,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:14:47,672 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:14:47,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:14:47,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:14:47,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:14:47,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:14:46" (1/2) ... [2024-06-03 20:14:47,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d42e33 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:47, skipping insertion in model container [2024-06-03 20:14:47,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:14:46" (1/2) ... [2024-06-03 20:14:47,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64a68213 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:47, skipping insertion in model container [2024-06-03 20:14:47,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:14:47" (2/2) ... [2024-06-03 20:14:47,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d42e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:47, skipping insertion in model container [2024-06-03 20:14:47,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:14:47" (2/2) ... [2024-06-03 20:14:47,681 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:14:47,832 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:14:47,833 INFO L97 edCorrectnessWitness]: Location invariant before [L860-L860] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-06-03 20:14:47,833 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-06-03 20:14:47,834 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-06-03 20:14:47,834 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:14:47,835 INFO L106 edCorrectnessWitness]: ghost_update [L855-L855] multithreaded = 1; [2024-06-03 20:14:47,883 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:14:48,302 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:14:48,313 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:14:48,491 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:14:48,522 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:14:48,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48 WrapperNode [2024-06-03 20:14:48,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:14:48,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:14:48,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:14:48,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:14:48,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,580 INFO L138 Inliner]: procedures = 175, calls = 109, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 276 [2024-06-03 20:14:48,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:14:48,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:14:48,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:14:48,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:14:48,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,622 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [2, 64]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-06-03 20:14:48,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:14:48,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:14:48,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:14:48,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:14:48,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (1/1) ... [2024-06-03 20:14:48,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:14:48,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:14:48,693 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-03 20:14:48,700 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-03 20:14:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:14:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:14:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:14:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:14:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:14:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:14:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:14:48,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:14:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:14:48,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:14:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:14:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:14:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:14:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:14:48,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:14:48,741 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:14:48,893 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:14:48,895 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:14:49,483 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:14:49,483 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:14:50,070 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:14:50,071 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:14:50,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:14:50 BoogieIcfgContainer [2024-06-03 20:14:50,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:14:50,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:14:50,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:14:50,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:14:50,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:14:46" (1/4) ... [2024-06-03 20:14:50,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbb6d4a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:14:50, skipping insertion in model container [2024-06-03 20:14:50,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:14:47" (2/4) ... [2024-06-03 20:14:50,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbb6d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:14:50, skipping insertion in model container [2024-06-03 20:14:50,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:48" (3/4) ... [2024-06-03 20:14:50,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbb6d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:14:50, skipping insertion in model container [2024-06-03 20:14:50,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:14:50" (4/4) ... [2024-06-03 20:14:50,081 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2024-06-03 20:14:50,099 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:14:50,099 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:14:50,100 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:14:50,195 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:14:50,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 20:14:50,272 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-03 20:14:50,273 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:14:50,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:14:50,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 20:14:50,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-03 20:14:50,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:14:50,305 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;@3b4ee686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:14:50,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:14:50,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:14:50,312 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:14:50,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:14:50,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:50,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:14:50,313 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-03 20:14:50,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2096490581, now seen corresponding path program 1 times [2024-06-03 20:14:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:50,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299462071] [2024-06-03 20:14:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:50,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299462071] [2024-06-03 20:14:53,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299462071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:53,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:53,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:14:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875418885] [2024-06-03 20:14:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:53,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:14:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:53,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:14:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:14:53,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:53,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:53,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:53,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:53,923 INFO L124 PetriNetUnfolderBase]: 743/1226 cut-off events. [2024-06-03 20:14:53,924 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 20:14:53,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1226 events. 743/1226 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5827 event pairs, 414 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 2443. Up to 1145 conditions per place. [2024-06-03 20:14:53,939 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 29 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 20:14:53,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow [2024-06-03 20:14:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:14:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:14:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-06-03 20:14:53,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-03 20:14:53,954 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 81 transitions. [2024-06-03 20:14:53,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow [2024-06-03 20:14:53,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:14:53,959 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 119 flow [2024-06-03 20:14:53,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-03 20:14:53,964 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-03 20:14:53,964 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 119 flow [2024-06-03 20:14:53,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:53,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:53,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:53,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:14:53,965 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-03 20:14:53,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash -387749302, now seen corresponding path program 1 times [2024-06-03 20:14:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:53,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623006688] [2024-06-03 20:14:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:56,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623006688] [2024-06-03 20:14:56,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623006688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:56,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:56,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:14:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81374976] [2024-06-03 20:14:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:56,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:14:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:14:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:14:56,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:56,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:56,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:56,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:56,883 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-03 20:14:56,883 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-06-03 20:14:56,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1366 events. 873/1366 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6304 event pairs, 316 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 3036. Up to 1301 conditions per place. [2024-06-03 20:14:56,893 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-03 20:14:56,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 267 flow [2024-06-03 20:14:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:14:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:14:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-03 20:14:56,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-03 20:14:56,895 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 119 flow. Second operand 5 states and 96 transitions. [2024-06-03 20:14:56,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 267 flow [2024-06-03 20:14:56,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:14:56,898 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 199 flow [2024-06-03 20:14:56,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-03 20:14:56,899 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-03 20:14:56,899 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 199 flow [2024-06-03 20:14:56,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:56,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:56,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:56,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:14:56,901 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-03 20:14:56,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -387629332, now seen corresponding path program 2 times [2024-06-03 20:14:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355534044] [2024-06-03 20:14:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:58,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355534044] [2024-06-03 20:14:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355534044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:58,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:14:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014431630] [2024-06-03 20:14:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:14:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:14:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:14:58,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:58,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:58,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:58,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:59,410 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-03 20:14:59,410 INFO L125 PetriNetUnfolderBase]: For 535/539 co-relation queries the response was YES. [2024-06-03 20:14:59,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1364 events. 871/1364 cut-off events. For 535/539 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6177 event pairs, 351 based on Foata normal form. 4/1368 useless extension candidates. Maximal degree in co-relation 3306. Up to 1300 conditions per place. [2024-06-03 20:14:59,420 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-06-03 20:14:59,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 335 flow [2024-06-03 20:14:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:14:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:14:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-03 20:14:59,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-03 20:14:59,427 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 199 flow. Second operand 5 states and 101 transitions. [2024-06-03 20:14:59,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 335 flow [2024-06-03 20:14:59,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 20:14:59,432 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 220 flow [2024-06-03 20:14:59,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-03 20:14:59,433 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-03 20:14:59,433 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 220 flow [2024-06-03 20:14:59,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:59,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:59,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:59,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:14:59,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:59,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 864488182, now seen corresponding path program 1 times [2024-06-03 20:14:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:59,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143809177] [2024-06-03 20:14:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:01,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-03 20:15:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143809177] [2024-06-03 20:15:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143809177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:15:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776372129] [2024-06-03 20:15:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:01,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:15:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:15:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:15:01,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:15:01,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:01,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:01,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:15:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:02,530 INFO L124 PetriNetUnfolderBase]: 795/1290 cut-off events. [2024-06-03 20:15:02,530 INFO L125 PetriNetUnfolderBase]: For 429/433 co-relation queries the response was YES. [2024-06-03 20:15:02,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1290 events. 795/1290 cut-off events. For 429/433 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6130 event pairs, 426 based on Foata normal form. 0/1255 useless extension candidates. Maximal degree in co-relation 3044. Up to 1224 conditions per place. [2024-06-03 20:15:02,538 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 38 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2024-06-03 20:15:02,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 365 flow [2024-06-03 20:15:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 20:15:02,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-03 20:15:02,541 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 220 flow. Second operand 6 states and 110 transitions. [2024-06-03 20:15:02,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 365 flow [2024-06-03 20:15:02,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:02,547 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 264 flow [2024-06-03 20:15:02,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-03 20:15:02,549 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2024-06-03 20:15:02,549 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 264 flow [2024-06-03 20:15:02,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:02,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:02,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:02,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:15:02,550 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-03 20:15:02,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1844562039, now seen corresponding path program 1 times [2024-06-03 20:15:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:02,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642825817] [2024-06-03 20:15:02,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642825817] [2024-06-03 20:15:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642825817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967885853] [2024-06-03 20:15:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:04,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:04,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:04,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:04,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:04,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:04,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:04,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:06,108 INFO L124 PetriNetUnfolderBase]: 939/1470 cut-off events. [2024-06-03 20:15:06,109 INFO L125 PetriNetUnfolderBase]: For 790/794 co-relation queries the response was YES. [2024-06-03 20:15:06,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 1470 events. 939/1470 cut-off events. For 790/794 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6778 event pairs, 402 based on Foata normal form. 8/1477 useless extension candidates. Maximal degree in co-relation 3752. Up to 1394 conditions per place. [2024-06-03 20:15:06,118 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 46 selfloop transitions, 21 changer transitions 0/74 dead transitions. [2024-06-03 20:15:06,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 470 flow [2024-06-03 20:15:06,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:15:06,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-03 20:15:06,122 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 264 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:15:06,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 470 flow [2024-06-03 20:15:06,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 466 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 20:15:06,131 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 371 flow [2024-06-03 20:15:06,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-06-03 20:15:06,134 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2024-06-03 20:15:06,134 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 371 flow [2024-06-03 20:15:06,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:06,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:06,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:06,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:15:06,135 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-03 20:15:06,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1844501589, now seen corresponding path program 2 times [2024-06-03 20:15:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:06,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577167229] [2024-06-03 20:15:06,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:06,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:08,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577167229] [2024-06-03 20:15:08,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577167229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:08,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:08,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596323291] [2024-06-03 20:15:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:08,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:08,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:08,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:08,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:08,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:09,456 INFO L124 PetriNetUnfolderBase]: 947/1482 cut-off events. [2024-06-03 20:15:09,457 INFO L125 PetriNetUnfolderBase]: For 1716/1720 co-relation queries the response was YES. [2024-06-03 20:15:09,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 1482 events. 947/1482 cut-off events. For 1716/1720 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6933 event pairs, 340 based on Foata normal form. 8/1487 useless extension candidates. Maximal degree in co-relation 4306. Up to 1397 conditions per place. [2024-06-03 20:15:09,467 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 41 selfloop transitions, 31 changer transitions 0/79 dead transitions. [2024-06-03 20:15:09,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 595 flow [2024-06-03 20:15:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:15:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:15:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 20:15:09,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-03 20:15:09,469 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 371 flow. Second operand 8 states and 141 transitions. [2024-06-03 20:15:09,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 595 flow [2024-06-03 20:15:09,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 560 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:09,474 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 470 flow [2024-06-03 20:15:09,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=470, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-06-03 20:15:09,478 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-03 20:15:09,478 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 470 flow [2024-06-03 20:15:09,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:09,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:09,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:09,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:15:09,479 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-03 20:15:09,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1844777303, now seen corresponding path program 1 times [2024-06-03 20:15:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:09,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974388717] [2024-06-03 20:15:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974388717] [2024-06-03 20:15:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974388717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51311748] [2024-06-03 20:15:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:11,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:11,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:15:11,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:11,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:11,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:15:11,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:13,295 INFO L124 PetriNetUnfolderBase]: 821/1363 cut-off events. [2024-06-03 20:15:13,296 INFO L125 PetriNetUnfolderBase]: For 2513/2517 co-relation queries the response was YES. [2024-06-03 20:15:13,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 1363 events. 821/1363 cut-off events. For 2513/2517 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6562 event pairs, 373 based on Foata normal form. 3/1364 useless extension candidates. Maximal degree in co-relation 4272. Up to 1228 conditions per place. [2024-06-03 20:15:13,305 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 62 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2024-06-03 20:15:13,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 785 flow [2024-06-03 20:15:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:15:13,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:15:13,306 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 470 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:15:13,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 785 flow [2024-06-03 20:15:13,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 94 transitions, 725 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:13,326 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 582 flow [2024-06-03 20:15:13,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=582, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2024-06-03 20:15:13,326 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-03 20:15:13,327 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 582 flow [2024-06-03 20:15:13,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:13,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:13,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:13,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:15:13,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:13,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1687116920, now seen corresponding path program 1 times [2024-06-03 20:15:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500243281] [2024-06-03 20:15:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500243281] [2024-06-03 20:15:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500243281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708222257] [2024-06-03 20:15:16,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:16,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:16,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:16,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:16,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:16,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:16,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 582 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:16,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:16,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:16,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:17,182 INFO L124 PetriNetUnfolderBase]: 935/1476 cut-off events. [2024-06-03 20:15:17,183 INFO L125 PetriNetUnfolderBase]: For 3427/3483 co-relation queries the response was YES. [2024-06-03 20:15:17,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 1476 events. 935/1476 cut-off events. For 3427/3483 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6900 event pairs, 306 based on Foata normal form. 6/1469 useless extension candidates. Maximal degree in co-relation 4974. Up to 1388 conditions per place. [2024-06-03 20:15:17,194 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 63 selfloop transitions, 22 changer transitions 0/92 dead transitions. [2024-06-03 20:15:17,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 794 flow [2024-06-03 20:15:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 20:15:17,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-06-03 20:15:17,197 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 582 flow. Second operand 7 states and 118 transitions. [2024-06-03 20:15:17,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 794 flow [2024-06-03 20:15:17,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 756 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-03 20:15:17,205 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 617 flow [2024-06-03 20:15:17,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2024-06-03 20:15:17,207 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-06-03 20:15:17,207 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 617 flow [2024-06-03 20:15:17,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:17,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:17,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:17,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:15:17,208 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-03 20:15:17,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1353533516, now seen corresponding path program 1 times [2024-06-03 20:15:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:17,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408497323] [2024-06-03 20:15:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:19,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408497323] [2024-06-03 20:15:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408497323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290612080] [2024-06-03 20:15:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:19,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:19,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:19,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:15:19,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 617 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:19,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:19,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:15:19,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:20,548 INFO L124 PetriNetUnfolderBase]: 818/1359 cut-off events. [2024-06-03 20:15:20,549 INFO L125 PetriNetUnfolderBase]: For 3780/3786 co-relation queries the response was YES. [2024-06-03 20:15:20,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4697 conditions, 1359 events. 818/1359 cut-off events. For 3780/3786 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6570 event pairs, 369 based on Foata normal form. 4/1362 useless extension candidates. Maximal degree in co-relation 4657. Up to 1228 conditions per place. [2024-06-03 20:15:20,561 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 67 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2024-06-03 20:15:20,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 860 flow [2024-06-03 20:15:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-03 20:15:20,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-03 20:15:20,563 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 617 flow. Second operand 6 states and 115 transitions. [2024-06-03 20:15:20,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 860 flow [2024-06-03 20:15:20,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 808 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:20,574 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 670 flow [2024-06-03 20:15:20,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=670, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2024-06-03 20:15:20,576 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2024-06-03 20:15:20,576 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 670 flow [2024-06-03 20:15:20,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:20,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:20,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:20,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:15:20,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:20,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1344487045, now seen corresponding path program 1 times [2024-06-03 20:15:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:20,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039137495] [2024-06-03 20:15:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039137495] [2024-06-03 20:15:22,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039137495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:22,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:15:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850931104] [2024-06-03 20:15:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:22,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:15:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:15:22,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:15:22,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:15:22,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 670 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:22,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:22,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:15:22,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:23,331 INFO L124 PetriNetUnfolderBase]: 1169/1877 cut-off events. [2024-06-03 20:15:23,331 INFO L125 PetriNetUnfolderBase]: For 4568/4633 co-relation queries the response was YES. [2024-06-03 20:15:23,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6201 conditions, 1877 events. 1169/1877 cut-off events. For 4568/4633 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9381 event pairs, 802 based on Foata normal form. 4/1868 useless extension candidates. Maximal degree in co-relation 6158. Up to 1745 conditions per place. [2024-06-03 20:15:23,344 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 78 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-06-03 20:15:23,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 969 flow [2024-06-03 20:15:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-03 20:15:23,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-03 20:15:23,346 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 670 flow. Second operand 6 states and 111 transitions. [2024-06-03 20:15:23,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 969 flow [2024-06-03 20:15:23,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 103 transitions, 880 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:23,355 INFO L231 Difference]: Finished difference. Result has 93 places, 99 transitions, 741 flow [2024-06-03 20:15:23,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=93, PETRI_TRANSITIONS=99} [2024-06-03 20:15:23,355 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-03 20:15:23,355 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 99 transitions, 741 flow [2024-06-03 20:15:23,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:23,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:23,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:15:23,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:23,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1906004940, now seen corresponding path program 2 times [2024-06-03 20:15:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:23,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422921163] [2024-06-03 20:15:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422921163] [2024-06-03 20:15:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422921163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:26,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:26,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:26,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518416624] [2024-06-03 20:15:26,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:26,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:26,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:26,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:26,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 99 transitions, 741 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:26,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:26,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:26,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:27,125 INFO L124 PetriNetUnfolderBase]: 1144/1840 cut-off events. [2024-06-03 20:15:27,125 INFO L125 PetriNetUnfolderBase]: For 4898/4965 co-relation queries the response was YES. [2024-06-03 20:15:27,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6478 conditions, 1840 events. 1144/1840 cut-off events. For 4898/4965 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9244 event pairs, 489 based on Foata normal form. 4/1833 useless extension candidates. Maximal degree in co-relation 6433. Up to 1738 conditions per place. [2024-06-03 20:15:27,136 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 85 selfloop transitions, 29 changer transitions 0/121 dead transitions. [2024-06-03 20:15:27,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 121 transitions, 1112 flow [2024-06-03 20:15:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:15:27,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:15:27,138 INFO L175 Difference]: Start difference. First operand has 93 places, 99 transitions, 741 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:15:27,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 121 transitions, 1112 flow [2024-06-03 20:15:27,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 1090 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 20:15:27,146 INFO L231 Difference]: Finished difference. Result has 101 places, 108 transitions, 896 flow [2024-06-03 20:15:27,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=896, PETRI_PLACES=101, PETRI_TRANSITIONS=108} [2024-06-03 20:15:27,147 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-06-03 20:15:27,147 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 108 transitions, 896 flow [2024-06-03 20:15:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:27,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:27,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:15:27,148 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:27,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1733515050, now seen corresponding path program 3 times [2024-06-03 20:15:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710930998] [2024-06-03 20:15:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:29,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:29,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710930998] [2024-06-03 20:15:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710930998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:29,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:29,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895009831] [2024-06-03 20:15:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:29,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:29,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:29,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 108 transitions, 896 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:29,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:29,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:29,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:30,429 INFO L124 PetriNetUnfolderBase]: 1145/1842 cut-off events. [2024-06-03 20:15:30,429 INFO L125 PetriNetUnfolderBase]: For 5715/5860 co-relation queries the response was YES. [2024-06-03 20:15:30,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 1842 events. 1145/1842 cut-off events. For 5715/5860 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9256 event pairs, 492 based on Foata normal form. 2/1833 useless extension candidates. Maximal degree in co-relation 6637. Up to 1747 conditions per place. [2024-06-03 20:15:30,441 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 31 changer transitions 0/117 dead transitions. [2024-06-03 20:15:30,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 117 transitions, 1169 flow [2024-06-03 20:15:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:15:30,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-03 20:15:30,443 INFO L175 Difference]: Start difference. First operand has 101 places, 108 transitions, 896 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:15:30,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 117 transitions, 1169 flow [2024-06-03 20:15:30,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 117 transitions, 1127 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-03 20:15:30,455 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 961 flow [2024-06-03 20:15:30,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=961, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2024-06-03 20:15:30,455 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2024-06-03 20:15:30,456 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 961 flow [2024-06-03 20:15:30,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:30,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:30,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:30,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:15:30,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:30,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1906243950, now seen corresponding path program 4 times [2024-06-03 20:15:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:30,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652992838] [2024-06-03 20:15:30,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652992838] [2024-06-03 20:15:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652992838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:33,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032958225] [2024-06-03 20:15:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:33,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:33,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:33,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 961 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:33,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:33,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:33,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:34,220 INFO L124 PetriNetUnfolderBase]: 1144/1837 cut-off events. [2024-06-03 20:15:34,221 INFO L125 PetriNetUnfolderBase]: For 5416/5521 co-relation queries the response was YES. [2024-06-03 20:15:34,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 1837 events. 1144/1837 cut-off events. For 5416/5521 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9243 event pairs, 384 based on Foata normal form. 2/1829 useless extension candidates. Maximal degree in co-relation 6531. Up to 1697 conditions per place. [2024-06-03 20:15:34,232 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 91 selfloop transitions, 31 changer transitions 0/129 dead transitions. [2024-06-03 20:15:34,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 129 transitions, 1290 flow [2024-06-03 20:15:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 20:15:34,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-03 20:15:34,234 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 961 flow. Second operand 7 states and 135 transitions. [2024-06-03 20:15:34,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 129 transitions, 1290 flow [2024-06-03 20:15:34,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 129 transitions, 1202 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 20:15:34,245 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 945 flow [2024-06-03 20:15:34,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=945, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2024-06-03 20:15:34,246 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-03 20:15:34,246 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 945 flow [2024-06-03 20:15:34,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:34,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:34,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:34,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:15:34,247 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-03 20:15:34,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash 40818498, now seen corresponding path program 1 times [2024-06-03 20:15:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638132247] [2024-06-03 20:15:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:36,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638132247] [2024-06-03 20:15:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638132247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051310587] [2024-06-03 20:15:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:36,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:36,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:36,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:36,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:36,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:36,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:38,038 INFO L124 PetriNetUnfolderBase]: 1157/1855 cut-off events. [2024-06-03 20:15:38,039 INFO L125 PetriNetUnfolderBase]: For 6068/6070 co-relation queries the response was YES. [2024-06-03 20:15:38,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 1855 events. 1157/1855 cut-off events. For 6068/6070 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9356 event pairs, 390 based on Foata normal form. 3/1857 useless extension candidates. Maximal degree in co-relation 6781. Up to 1663 conditions per place. [2024-06-03 20:15:38,054 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 93 selfloop transitions, 52 changer transitions 0/151 dead transitions. [2024-06-03 20:15:38,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 151 transitions, 1496 flow [2024-06-03 20:15:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:15:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:15:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 20:15:38,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 20:15:38,056 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 945 flow. Second operand 8 states and 149 transitions. [2024-06-03 20:15:38,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 151 transitions, 1496 flow [2024-06-03 20:15:38,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1410 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 20:15:38,069 INFO L231 Difference]: Finished difference. Result has 109 places, 129 transitions, 1168 flow [2024-06-03 20:15:38,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1168, PETRI_PLACES=109, PETRI_TRANSITIONS=129} [2024-06-03 20:15:38,071 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-06-03 20:15:38,071 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 129 transitions, 1168 flow [2024-06-03 20:15:38,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:38,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:38,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:38,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:15:38,073 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-03 20:15:38,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash -990458250, now seen corresponding path program 2 times [2024-06-03 20:15:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370085783] [2024-06-03 20:15:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:40,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370085783] [2024-06-03 20:15:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370085783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116027074] [2024-06-03 20:15:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:40,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:40,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:40,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:40,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:40,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 129 transitions, 1168 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:40,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:40,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:40,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:42,159 INFO L124 PetriNetUnfolderBase]: 1130/1812 cut-off events. [2024-06-03 20:15:42,159 INFO L125 PetriNetUnfolderBase]: For 8725/8727 co-relation queries the response was YES. [2024-06-03 20:15:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7412 conditions, 1812 events. 1130/1812 cut-off events. For 8725/8727 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9051 event pairs, 379 based on Foata normal form. 3/1814 useless extension candidates. Maximal degree in co-relation 7361. Up to 1608 conditions per place. [2024-06-03 20:15:42,171 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 66 changer transitions 0/167 dead transitions. [2024-06-03 20:15:42,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 167 transitions, 1872 flow [2024-06-03 20:15:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:15:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:15:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-03 20:15:42,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2024-06-03 20:15:42,173 INFO L175 Difference]: Start difference. First operand has 109 places, 129 transitions, 1168 flow. Second operand 9 states and 158 transitions. [2024-06-03 20:15:42,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 167 transitions, 1872 flow [2024-06-03 20:15:42,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1775 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-06-03 20:15:42,192 INFO L231 Difference]: Finished difference. Result has 118 places, 147 transitions, 1475 flow [2024-06-03 20:15:42,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1475, PETRI_PLACES=118, PETRI_TRANSITIONS=147} [2024-06-03 20:15:42,192 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places. [2024-06-03 20:15:42,192 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1475 flow [2024-06-03 20:15:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:42,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:42,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:42,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:15:42,193 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-03 20:15:42,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:42,194 INFO L85 PathProgramCache]: Analyzing trace with hash -990397800, now seen corresponding path program 3 times [2024-06-03 20:15:42,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:42,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262232558] [2024-06-03 20:15:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:42,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:44,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262232558] [2024-06-03 20:15:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262232558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:44,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:44,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519968713] [2024-06-03 20:15:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:44,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:44,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:44,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:44,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1475 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:44,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:44,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:44,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:45,969 INFO L124 PetriNetUnfolderBase]: 1124/1800 cut-off events. [2024-06-03 20:15:45,969 INFO L125 PetriNetUnfolderBase]: For 9501/9503 co-relation queries the response was YES. [2024-06-03 20:15:45,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7537 conditions, 1800 events. 1124/1800 cut-off events. For 9501/9503 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8978 event pairs, 377 based on Foata normal form. 3/1802 useless extension candidates. Maximal degree in co-relation 7482. Up to 1604 conditions per place. [2024-06-03 20:15:45,981 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 101 selfloop transitions, 60 changer transitions 0/167 dead transitions. [2024-06-03 20:15:45,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 167 transitions, 1922 flow [2024-06-03 20:15:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:15:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:15:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 20:15:45,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 20:15:45,983 INFO L175 Difference]: Start difference. First operand has 118 places, 147 transitions, 1475 flow. Second operand 8 states and 144 transitions. [2024-06-03 20:15:45,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 167 transitions, 1922 flow [2024-06-03 20:15:46,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 167 transitions, 1802 flow, removed 59 selfloop flow, removed 1 redundant places. [2024-06-03 20:15:46,005 INFO L231 Difference]: Finished difference. Result has 126 places, 147 transitions, 1489 flow [2024-06-03 20:15:46,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1489, PETRI_PLACES=126, PETRI_TRANSITIONS=147} [2024-06-03 20:15:46,006 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-03 20:15:46,006 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 147 transitions, 1489 flow [2024-06-03 20:15:46,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:46,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:46,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:46,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:15:46,006 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-03 20:15:46,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash -80639027, now seen corresponding path program 1 times [2024-06-03 20:15:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357979825] [2024-06-03 20:15:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357979825] [2024-06-03 20:15:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357979825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:48,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771199298] [2024-06-03 20:15:48,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:48,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:48,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:48,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 147 transitions, 1489 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:48,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:48,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:48,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:49,529 INFO L124 PetriNetUnfolderBase]: 1195/1922 cut-off events. [2024-06-03 20:15:49,529 INFO L125 PetriNetUnfolderBase]: For 10844/10846 co-relation queries the response was YES. [2024-06-03 20:15:49,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 1922 events. 1195/1922 cut-off events. For 10844/10846 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9726 event pairs, 387 based on Foata normal form. 2/1923 useless extension candidates. Maximal degree in co-relation 8144. Up to 1694 conditions per place. [2024-06-03 20:15:49,542 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 105 selfloop transitions, 69 changer transitions 0/180 dead transitions. [2024-06-03 20:15:49,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 180 transitions, 2120 flow [2024-06-03 20:15:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-03 20:15:49,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-03 20:15:49,544 INFO L175 Difference]: Start difference. First operand has 126 places, 147 transitions, 1489 flow. Second operand 7 states and 136 transitions. [2024-06-03 20:15:49,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 180 transitions, 2120 flow [2024-06-03 20:15:49,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 180 transitions, 1941 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 20:15:49,569 INFO L231 Difference]: Finished difference. Result has 127 places, 158 transitions, 1631 flow [2024-06-03 20:15:49,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1631, PETRI_PLACES=127, PETRI_TRANSITIONS=158} [2024-06-03 20:15:49,569 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places. [2024-06-03 20:15:49,570 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 158 transitions, 1631 flow [2024-06-03 20:15:49,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:49,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:49,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:49,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:15:49,570 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:49,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -732443706, now seen corresponding path program 1 times [2024-06-03 20:15:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895022980] [2024-06-03 20:15:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:51,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895022980] [2024-06-03 20:15:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895022980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354774427] [2024-06-03 20:15:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:51,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:51,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 158 transitions, 1631 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:51,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:51,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:51,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:52,763 INFO L124 PetriNetUnfolderBase]: 1461/2236 cut-off events. [2024-06-03 20:15:52,763 INFO L125 PetriNetUnfolderBase]: For 11402/11431 co-relation queries the response was YES. [2024-06-03 20:15:52,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9584 conditions, 2236 events. 1461/2236 cut-off events. For 11402/11431 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10977 event pairs, 714 based on Foata normal form. 8/2238 useless extension candidates. Maximal degree in co-relation 9524. Up to 2129 conditions per place. [2024-06-03 20:15:52,775 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 136 selfloop transitions, 39 changer transitions 0/181 dead transitions. [2024-06-03 20:15:52,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 181 transitions, 2228 flow [2024-06-03 20:15:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:15:52,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-03 20:15:52,777 INFO L175 Difference]: Start difference. First operand has 127 places, 158 transitions, 1631 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:15:52,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 181 transitions, 2228 flow [2024-06-03 20:15:52,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 181 transitions, 2080 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:52,797 INFO L231 Difference]: Finished difference. Result has 133 places, 172 transitions, 1801 flow [2024-06-03 20:15:52,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1801, PETRI_PLACES=133, PETRI_TRANSITIONS=172} [2024-06-03 20:15:52,797 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-06-03 20:15:52,797 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 172 transitions, 1801 flow [2024-06-03 20:15:52,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:52,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:52,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:15:52,798 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-03 20:15:52,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash -629274547, now seen corresponding path program 2 times [2024-06-03 20:15:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789244523] [2024-06-03 20:15:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15: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-03 20:15:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:54,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789244523] [2024-06-03 20:15:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789244523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:54,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:54,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923195280] [2024-06-03 20:15:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:54,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:54,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:54,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:54,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:54,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 172 transitions, 1801 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:54,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:54,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:54,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:56,296 INFO L124 PetriNetUnfolderBase]: 1297/2062 cut-off events. [2024-06-03 20:15:56,297 INFO L125 PetriNetUnfolderBase]: For 14561/14575 co-relation queries the response was YES. [2024-06-03 20:15:56,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9633 conditions, 2062 events. 1297/2062 cut-off events. For 14561/14575 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10633 event pairs, 492 based on Foata normal form. 12/2011 useless extension candidates. Maximal degree in co-relation 9570. Up to 1800 conditions per place. [2024-06-03 20:15:56,310 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 121 selfloop transitions, 71 changer transitions 0/198 dead transitions. [2024-06-03 20:15:56,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 198 transitions, 2387 flow [2024-06-03 20:15:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:15:56,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:15:56,311 INFO L175 Difference]: Start difference. First operand has 133 places, 172 transitions, 1801 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:15:56,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 198 transitions, 2387 flow [2024-06-03 20:15:56,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 198 transitions, 2312 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:56,333 INFO L231 Difference]: Finished difference. Result has 138 places, 176 transitions, 1958 flow [2024-06-03 20:15:56,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1958, PETRI_PLACES=138, PETRI_TRANSITIONS=176} [2024-06-03 20:15:56,334 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-03 20:15:56,334 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 176 transitions, 1958 flow [2024-06-03 20:15:56,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:56,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:56,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:56,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:15:56,335 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-03 20:15:56,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash -629334997, now seen corresponding path program 3 times [2024-06-03 20:15:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336665134] [2024-06-03 20:15:56,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336665134] [2024-06-03 20:15:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336665134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:58,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084017684] [2024-06-03 20:15:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:58,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:58,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:58,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:58,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:58,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 176 transitions, 1958 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:58,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:58,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:58,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:59,803 INFO L124 PetriNetUnfolderBase]: 1293/2056 cut-off events. [2024-06-03 20:15:59,803 INFO L125 PetriNetUnfolderBase]: For 15381/15395 co-relation queries the response was YES. [2024-06-03 20:15:59,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9745 conditions, 2056 events. 1293/2056 cut-off events. For 15381/15395 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10554 event pairs, 496 based on Foata normal form. 12/2005 useless extension candidates. Maximal degree in co-relation 9680. Up to 1797 conditions per place. [2024-06-03 20:15:59,815 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 115 selfloop transitions, 74 changer transitions 0/195 dead transitions. [2024-06-03 20:15:59,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 2452 flow [2024-06-03 20:15:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 20:15:59,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-03 20:15:59,818 INFO L175 Difference]: Start difference. First operand has 138 places, 176 transitions, 1958 flow. Second operand 7 states and 127 transitions. [2024-06-03 20:15:59,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 2452 flow [2024-06-03 20:15:59,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 2205 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-03 20:15:59,850 INFO L231 Difference]: Finished difference. Result has 139 places, 178 transitions, 1899 flow [2024-06-03 20:15:59,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1899, PETRI_PLACES=139, PETRI_TRANSITIONS=178} [2024-06-03 20:15:59,851 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-06-03 20:15:59,851 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 178 transitions, 1899 flow [2024-06-03 20:15:59,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:59,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:59,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:59,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:15:59,852 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:59,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1157663148, now seen corresponding path program 2 times [2024-06-03 20:15:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984197695] [2024-06-03 20:15:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984197695] [2024-06-03 20:16:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984197695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:01,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503089605] [2024-06-03 20:16:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:01,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:01,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:16:01,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 178 transitions, 1899 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:01,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:01,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:16:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:03,063 INFO L124 PetriNetUnfolderBase]: 1471/2255 cut-off events. [2024-06-03 20:16:03,063 INFO L125 PetriNetUnfolderBase]: For 14371/14374 co-relation queries the response was YES. [2024-06-03 20:16:03,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10512 conditions, 2255 events. 1471/2255 cut-off events. For 14371/14374 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11108 event pairs, 719 based on Foata normal form. 13/2261 useless extension candidates. Maximal degree in co-relation 10447. Up to 2134 conditions per place. [2024-06-03 20:16:03,076 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 60 changer transitions 0/208 dead transitions. [2024-06-03 20:16:03,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 208 transitions, 2678 flow [2024-06-03 20:16:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:16:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:16:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-03 20:16:03,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-03 20:16:03,078 INFO L175 Difference]: Start difference. First operand has 139 places, 178 transitions, 1899 flow. Second operand 8 states and 142 transitions. [2024-06-03 20:16:03,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 208 transitions, 2678 flow [2024-06-03 20:16:03,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 208 transitions, 2531 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 20:16:03,099 INFO L231 Difference]: Finished difference. Result has 144 places, 196 transitions, 2193 flow [2024-06-03 20:16:03,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2193, PETRI_PLACES=144, PETRI_TRANSITIONS=196} [2024-06-03 20:16:03,099 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2024-06-03 20:16:03,099 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 196 transitions, 2193 flow [2024-06-03 20:16:03,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:03,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:03,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:03,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:16:03,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:16:03,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash -732228442, now seen corresponding path program 1 times [2024-06-03 20:16:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702281025] [2024-06-03 20:16:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:05,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702281025] [2024-06-03 20:16:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702281025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:05,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253764155] [2024-06-03 20:16:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:05,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:05,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:16:05,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 196 transitions, 2193 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:05,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:05,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:16:05,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:06,421 INFO L124 PetriNetUnfolderBase]: 1267/2014 cut-off events. [2024-06-03 20:16:06,421 INFO L125 PetriNetUnfolderBase]: For 15653/15682 co-relation queries the response was YES. [2024-06-03 20:16:06,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10002 conditions, 2014 events. 1267/2014 cut-off events. For 15653/15682 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10130 event pairs, 554 based on Foata normal form. 3/2010 useless extension candidates. Maximal degree in co-relation 9935. Up to 1860 conditions per place. [2024-06-03 20:16:06,434 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 166 selfloop transitions, 38 changer transitions 0/211 dead transitions. [2024-06-03 20:16:06,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 2719 flow [2024-06-03 20:16:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:16:06,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:16:06,435 INFO L175 Difference]: Start difference. First operand has 144 places, 196 transitions, 2193 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:16:06,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 2719 flow [2024-06-03 20:16:06,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 211 transitions, 2584 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-03 20:16:06,460 INFO L231 Difference]: Finished difference. Result has 149 places, 203 transitions, 2237 flow [2024-06-03 20:16:06,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2237, PETRI_PLACES=149, PETRI_TRANSITIONS=203} [2024-06-03 20:16:06,460 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-06-03 20:16:06,460 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 203 transitions, 2237 flow [2024-06-03 20:16:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:06,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:06,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:06,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:16:06,461 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-03 20:16:06,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -56148585, now seen corresponding path program 1 times [2024-06-03 20:16:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307548943] [2024-06-03 20:16:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:09,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307548943] [2024-06-03 20:16:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307548943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:09,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:09,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:16:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417587168] [2024-06-03 20:16:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:09,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:16:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:16:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:16:09,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:16:09,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 203 transitions, 2237 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:09,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:09,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:16:09,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:10,055 INFO L124 PetriNetUnfolderBase]: 1132/1868 cut-off events. [2024-06-03 20:16:10,055 INFO L125 PetriNetUnfolderBase]: For 17148/17226 co-relation queries the response was YES. [2024-06-03 20:16:10,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9523 conditions, 1868 events. 1132/1868 cut-off events. For 17148/17226 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9757 event pairs, 473 based on Foata normal form. 2/1824 useless extension candidates. Maximal degree in co-relation 9452. Up to 1715 conditions per place. [2024-06-03 20:16:10,069 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 184 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2024-06-03 20:16:10,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 210 transitions, 2694 flow [2024-06-03 20:16:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 20:16:10,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-03 20:16:10,070 INFO L175 Difference]: Start difference. First operand has 149 places, 203 transitions, 2237 flow. Second operand 7 states and 123 transitions. [2024-06-03 20:16:10,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 210 transitions, 2694 flow [2024-06-03 20:16:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 210 transitions, 2642 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-03 20:16:10,097 INFO L231 Difference]: Finished difference. Result has 154 places, 205 transitions, 2258 flow [2024-06-03 20:16:10,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2258, PETRI_PLACES=154, PETRI_TRANSITIONS=205} [2024-06-03 20:16:10,098 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-03 20:16:10,098 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 205 transitions, 2258 flow [2024-06-03 20:16:10,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:10,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:10,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:10,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 20:16:10,098 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-03 20:16:10,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -639156107, now seen corresponding path program 2 times [2024-06-03 20:16:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355940135] [2024-06-03 20:16:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355940135] [2024-06-03 20:16:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355940135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829462753] [2024-06-03 20:16:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:13,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:13,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:16:13,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 205 transitions, 2258 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:13,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:13,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:16:13,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:14,647 INFO L124 PetriNetUnfolderBase]: 1135/1875 cut-off events. [2024-06-03 20:16:14,647 INFO L125 PetriNetUnfolderBase]: For 18243/18319 co-relation queries the response was YES. [2024-06-03 20:16:14,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9648 conditions, 1875 events. 1135/1875 cut-off events. For 18243/18319 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9831 event pairs, 449 based on Foata normal form. 2/1829 useless extension candidates. Maximal degree in co-relation 9575. Up to 1685 conditions per place. [2024-06-03 20:16:14,657 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 166 selfloop transitions, 42 changer transitions 0/215 dead transitions. [2024-06-03 20:16:14,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 215 transitions, 2737 flow [2024-06-03 20:16:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:16:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:16:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 20:16:14,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-03 20:16:14,658 INFO L175 Difference]: Start difference. First operand has 154 places, 205 transitions, 2258 flow. Second operand 8 states and 143 transitions. [2024-06-03 20:16:14,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 215 transitions, 2737 flow [2024-06-03 20:16:14,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 215 transitions, 2678 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:16:14,684 INFO L231 Difference]: Finished difference. Result has 157 places, 207 transitions, 2324 flow [2024-06-03 20:16:14,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2324, PETRI_PLACES=157, PETRI_TRANSITIONS=207} [2024-06-03 20:16:14,685 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places. [2024-06-03 20:16:14,685 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 207 transitions, 2324 flow [2024-06-03 20:16:14,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:14,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:14,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:14,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 20:16:14,686 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-03 20:16:14,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -629325077, now seen corresponding path program 3 times [2024-06-03 20:16:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033636527] [2024-06-03 20:16:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:17,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:17,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033636527] [2024-06-03 20:16:17,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033636527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:17,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:17,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170043260] [2024-06-03 20:16:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:17,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:16:17,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 207 transitions, 2324 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:17,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:17,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:16:17,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:18,822 INFO L124 PetriNetUnfolderBase]: 1138/1880 cut-off events. [2024-06-03 20:16:18,822 INFO L125 PetriNetUnfolderBase]: For 19410/19488 co-relation queries the response was YES. [2024-06-03 20:16:18,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 1880 events. 1138/1880 cut-off events. For 19410/19488 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9846 event pairs, 445 based on Foata normal form. 4/1838 useless extension candidates. Maximal degree in co-relation 9752. Up to 1690 conditions per place. [2024-06-03 20:16:18,835 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 172 selfloop transitions, 38 changer transitions 0/217 dead transitions. [2024-06-03 20:16:18,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 217 transitions, 2809 flow [2024-06-03 20:16:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 20:16:18,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-03 20:16:18,836 INFO L175 Difference]: Start difference. First operand has 157 places, 207 transitions, 2324 flow. Second operand 7 states and 129 transitions. [2024-06-03 20:16:18,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 217 transitions, 2809 flow [2024-06-03 20:16:18,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 217 transitions, 2702 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 20:16:18,866 INFO L231 Difference]: Finished difference. Result has 158 places, 209 transitions, 2336 flow [2024-06-03 20:16:18,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2336, PETRI_PLACES=158, PETRI_TRANSITIONS=209} [2024-06-03 20:16:18,867 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2024-06-03 20:16:18,867 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 2336 flow [2024-06-03 20:16:18,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:18,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:18,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:18,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 20:16:18,868 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-03 20:16:18,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -628967027, now seen corresponding path program 4 times [2024-06-03 20:16:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947273967] [2024-06-03 20:16:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:21,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:21,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947273967] [2024-06-03 20:16:21,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947273967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:21,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:21,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:21,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999159257] [2024-06-03 20:16:21,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:21,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:21,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:16:21,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 2336 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:21,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:21,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:16:21,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:23,108 INFO L124 PetriNetUnfolderBase]: 1127/1862 cut-off events. [2024-06-03 20:16:23,108 INFO L125 PetriNetUnfolderBase]: For 19812/19894 co-relation queries the response was YES. [2024-06-03 20:16:23,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 1862 events. 1127/1862 cut-off events. For 19812/19894 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9757 event pairs, 429 based on Foata normal form. 4/1820 useless extension candidates. Maximal degree in co-relation 9727. Up to 1645 conditions per place. [2024-06-03 20:16:23,123 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 175 selfloop transitions, 42 changer transitions 0/224 dead transitions. [2024-06-03 20:16:23,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 224 transitions, 2893 flow [2024-06-03 20:16:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-03 20:16:23,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-03 20:16:23,124 INFO L175 Difference]: Start difference. First operand has 158 places, 209 transitions, 2336 flow. Second operand 7 states and 132 transitions. [2024-06-03 20:16:23,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 224 transitions, 2893 flow [2024-06-03 20:16:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 224 transitions, 2790 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 20:16:23,155 INFO L231 Difference]: Finished difference. Result has 161 places, 214 transitions, 2423 flow [2024-06-03 20:16:23,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2423, PETRI_PLACES=161, PETRI_TRANSITIONS=214} [2024-06-03 20:16:23,156 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-03 20:16:23,156 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 214 transitions, 2423 flow [2024-06-03 20:16:23,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:16:23,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:23,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:23,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 20:16:23,156 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:16:23,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -733026940, now seen corresponding path program 1 times [2024-06-03 20:16:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783039870] [2024-06-03 20:16:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:16:23,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:16:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:16:23,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:16:23,226 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:16:23,227 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:16:23,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:16:23,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:16:23,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:16:23,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:16:23,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:16:23,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 20:16:23,230 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:23,235 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:16:23,235 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:16:23,268 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,269 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,270 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,270 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,270 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,271 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,271 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,271 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,271 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,272 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,274 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,275 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,275 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,275 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,275 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:16:23,279 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:16:23,289 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:16:23,290 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:16:23,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:16:23 BasicIcfg [2024-06-03 20:16:23,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:16:23,291 INFO L158 Benchmark]: Toolchain (without parser) took 95619.09ms. Allocated memory was 146.8MB in the beginning and 950.0MB in the end (delta: 803.2MB). Free memory was 84.6MB in the beginning and 494.7MB in the end (delta: -410.1MB). Peak memory consumption was 394.6MB. Max. memory is 16.1GB. [2024-06-03 20:16:23,291 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:16:23,291 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:16:23,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.80ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 102.7MB in the end (delta: -18.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-06-03 20:16:23,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.39ms. Allocated memory is still 146.8MB. Free memory was 102.7MB in the beginning and 98.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:16:23,292 INFO L158 Benchmark]: Boogie Preprocessor took 77.08ms. Allocated memory is still 146.8MB. Free memory was 98.5MB in the beginning and 93.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:16:23,292 INFO L158 Benchmark]: RCFGBuilder took 1412.94ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 93.7MB in the beginning and 62.9MB in the end (delta: 30.7MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2024-06-03 20:16:23,293 INFO L158 Benchmark]: TraceAbstraction took 93216.43ms. Allocated memory was 184.5MB in the beginning and 950.0MB in the end (delta: 765.5MB). Free memory was 61.9MB in the beginning and 494.7MB in the end (delta: -432.8MB). Peak memory consumption was 333.7MB. Max. memory is 16.1GB. [2024-06-03 20:16:23,294 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.80ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 102.7MB in the end (delta: -18.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.39ms. Allocated memory is still 146.8MB. Free memory was 102.7MB in the beginning and 98.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.08ms. Allocated memory is still 146.8MB. Free memory was 98.5MB in the beginning and 93.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1412.94ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 93.7MB in the beginning and 62.9MB in the end (delta: 30.7MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * TraceAbstraction took 93216.43ms. Allocated memory was 184.5MB in the beginning and 950.0MB in the end (delta: 765.5MB). Free memory was 61.9MB in the beginning and 494.7MB in the end (delta: -432.8MB). Peak memory consumption was 333.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 860]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 //@ ghost multithreaded = 1; [L855] FCALL, FORK 0 pthread_create(&t2381, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 pthread_t t2382; [L857] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] FCALL, FORK 0 pthread_create(&t2382, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-2, t2382=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 pthread_t t2383; [L859] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] FCALL, FORK 0 pthread_create(&t2383, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-2, t2382=-1, t2383=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L860] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-2, t2382=-1, t2383=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 857]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 93.0s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1105 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4820 IncrementalHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 71 mSDtfsCounter, 4820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 34.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2423occurred in iteration=26, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 61.2s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 39475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-03 20:16:23,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE