./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:41:04,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:41:04,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:41:04,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:41:04,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:41:04,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:41:04,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:41:04,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:41:04,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:41:04,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:41:04,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:41:04,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:41:04,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:41:04,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:41:04,720 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:41:04,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:41:04,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:41:04,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:41:04,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:41:04,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:41:04,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:41:04,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:41:04,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:41:04,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:41:04,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:41:04,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:41:04,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:41:04,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:41:04,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:41:04,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:41:04,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:41:04,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:41:04,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:41:04,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:41:04,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:41:04,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:41:04,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:41:04,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:41:04,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:41:04,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:41:04,727 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:41:04,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:41:04,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:41:04,728 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 [2024-06-28 01:41:04,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:41:04,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:41:04,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:41:04,998 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:41:04,999 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:41:05,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-28 01:41:05,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:41:05,149 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:41:05,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-28 01:41:06,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:41:06,574 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:41:06,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-28 01:41:06,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244f763da/8bcad1bdabe246e782b4429387f4af94/FLAG6974f5ee5 [2024-06-28 01:41:06,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244f763da/8bcad1bdabe246e782b4429387f4af94 [2024-06-28 01:41:06,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:41:06,617 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:41:06,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:41:06,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:41:06,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:41:06,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:41:05" (1/2) ... [2024-06-28 01:41:06,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bd34fe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:41:06, skipping insertion in model container [2024-06-28 01:41:06,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:41:05" (1/2) ... [2024-06-28 01:41:06,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25807cf8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:41:06, skipping insertion in model container [2024-06-28 01:41:06,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:41:06" (2/2) ... [2024-06-28 01:41:06,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bd34fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:06, skipping insertion in model container [2024-06-28 01:41:06,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:41:06" (2/2) ... [2024-06-28 01:41:06,631 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:41:06,692 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:41:06,693 INFO L97 edCorrectnessWitness]: Location invariant before [L808-L808] (((((((((((((! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:41:06,693 INFO L97 edCorrectnessWitness]: Location invariant before [L809-L809] (((((((((((((! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:41:06,694 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:41:06,694 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-06-28 01:41:06,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:41:06,927 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-06-28 01:41:07,150 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:41:07,159 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:41:07,202 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:41:07,262 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:41:07,306 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:41:07,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07 WrapperNode [2024-06-28 01:41:07,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:41:07,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:41:07,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:41:07,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:41:07,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,365 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2024-06-28 01:41:07,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:41:07,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:41:07,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:41:07,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:41:07,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 01:41:07,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:41:07,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:41:07,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:41:07,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:41:07,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (1/1) ... [2024-06-28 01:41:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:41:07,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:41:07,481 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-28 01:41:07,504 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-28 01:41:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:41:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:41:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:41:07,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:41:07,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:41:07,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:41:07,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:41:07,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:41:07,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:41:07,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:41:07,526 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:41:07,662 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:41:07,664 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:41:08,057 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:41:08,058 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:41:08,219 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:41:08,220 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:41:08,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:41:08 BoogieIcfgContainer [2024-06-28 01:41:08,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:41:08,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:41:08,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:41:08,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:41:08,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:41:05" (1/4) ... [2024-06-28 01:41:08,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55974756 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:41:08, skipping insertion in model container [2024-06-28 01:41:08,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:41:06" (2/4) ... [2024-06-28 01:41:08,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55974756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:41:08, skipping insertion in model container [2024-06-28 01:41:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:41:07" (3/4) ... [2024-06-28 01:41:08,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55974756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:41:08, skipping insertion in model container [2024-06-28 01:41:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:41:08" (4/4) ... [2024-06-28 01:41:08,231 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-28 01:41:08,246 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:41:08,246 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:41:08,247 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:41:08,283 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:41:08,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:41:08,348 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 01:41:08,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:41:08,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-28 01:41:08,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:41:08,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-28 01:41:08,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:41:08,377 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;@501c960b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:41:08,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:41:08,383 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:41:08,383 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:41:08,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:41:08,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:08,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:41:08,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:08,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 305573774, now seen corresponding path program 1 times [2024-06-28 01:41:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692855935] [2024-06-28 01:41:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:08,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692855935] [2024-06-28 01:41:08,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692855935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:08,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:08,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:41:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881411355] [2024-06-28 01:41:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:08,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:41:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:41:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:41:08,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-28 01:41:08,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:08,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:08,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-28 01:41:08,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:08,996 INFO L124 PetriNetUnfolderBase]: 138/344 cut-off events. [2024-06-28 01:41:08,997 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:41:08,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 344 events. 138/344 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1691 event pairs, 95 based on Foata normal form. 16/340 useless extension candidates. Maximal degree in co-relation 594. Up to 205 conditions per place. [2024-06-28 01:41:09,002 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2024-06-28 01:41:09,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 147 flow [2024-06-28 01:41:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:41:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:41:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-28 01:41:09,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2024-06-28 01:41:09,016 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 81 transitions. [2024-06-28 01:41:09,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 147 flow [2024-06-28 01:41:09,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:09,021 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-06-28 01:41:09,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-28 01:41:09,026 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-06-28 01:41:09,026 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-06-28 01:41:09,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:09,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:09,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:41:09,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:41:09,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:09,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 305573616, now seen corresponding path program 1 times [2024-06-28 01:41:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:09,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601715700] [2024-06-28 01:41:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:09,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601715700] [2024-06-28 01:41:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601715700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:41:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244408526] [2024-06-28 01:41:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:09,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:41:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:41:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:41:09,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:41:09,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:09,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:09,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:41:09,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:09,677 INFO L124 PetriNetUnfolderBase]: 342/590 cut-off events. [2024-06-28 01:41:09,678 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-06-28 01:41:09,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 590 events. 342/590 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2694 event pairs, 157 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 1216. Up to 573 conditions per place. [2024-06-28 01:41:09,685 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-06-28 01:41:09,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 150 flow [2024-06-28 01:41:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:41:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:41:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-28 01:41:09,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-28 01:41:09,689 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 65 transitions. [2024-06-28 01:41:09,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 150 flow [2024-06-28 01:41:09,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:09,693 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 85 flow [2024-06-28 01:41:09,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-28 01:41:09,694 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-06-28 01:41:09,694 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 85 flow [2024-06-28 01:41:09,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:09,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:09,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:09,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:41:09,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:09,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1598624388, now seen corresponding path program 1 times [2024-06-28 01:41:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114519722] [2024-06-28 01:41:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114519722] [2024-06-28 01:41:10,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114519722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:10,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:10,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:41:10,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966863278] [2024-06-28 01:41:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:10,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:41:10,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:41:10,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:41:10,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:41:10,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:10,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:10,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:41:10,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:10,306 INFO L124 PetriNetUnfolderBase]: 342/730 cut-off events. [2024-06-28 01:41:10,307 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-06-28 01:41:10,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 730 events. 342/730 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3821 event pairs, 218 based on Foata normal form. 2/696 useless extension candidates. Maximal degree in co-relation 1443. Up to 562 conditions per place. [2024-06-28 01:41:10,312 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 34 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2024-06-28 01:41:10,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 211 flow [2024-06-28 01:41:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:41:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:41:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-06-28 01:41:10,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-28 01:41:10,314 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 85 flow. Second operand 4 states and 84 transitions. [2024-06-28 01:41:10,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 211 flow [2024-06-28 01:41:10,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:41:10,316 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 131 flow [2024-06-28 01:41:10,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 01:41:10,318 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-06-28 01:41:10,318 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 131 flow [2024-06-28 01:41:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:10,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:10,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:10,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:41:10,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:10,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1982251077, now seen corresponding path program 1 times [2024-06-28 01:41:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116918623] [2024-06-28 01:41:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116918623] [2024-06-28 01:41:10,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116918623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:10,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:10,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:41:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216225923] [2024-06-28 01:41:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:10,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:41:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:10,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:41:10,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:41:10,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:41:10,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:10,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:10,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:41:10,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:11,106 INFO L124 PetriNetUnfolderBase]: 422/848 cut-off events. [2024-06-28 01:41:11,111 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-06-28 01:41:11,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 848 events. 422/848 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4580 event pairs, 154 based on Foata normal form. 5/814 useless extension candidates. Maximal degree in co-relation 1882. Up to 557 conditions per place. [2024-06-28 01:41:11,119 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 49 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2024-06-28 01:41:11,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 351 flow [2024-06-28 01:41:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:41:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:41:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-28 01:41:11,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2024-06-28 01:41:11,124 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 131 flow. Second operand 5 states and 114 transitions. [2024-06-28 01:41:11,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 351 flow [2024-06-28 01:41:11,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:41:11,129 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 214 flow [2024-06-28 01:41:11,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-06-28 01:41:11,131 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-28 01:41:11,131 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 214 flow [2024-06-28 01:41:11,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:11,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:11,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:41:11,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:11,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1458768915, now seen corresponding path program 1 times [2024-06-28 01:41:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:11,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599577922] [2024-06-28 01:41:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599577922] [2024-06-28 01:41:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599577922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:11,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:41:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231749365] [2024-06-28 01:41:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:41:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:41:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:41:11,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:41:11,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:11,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:11,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:41:11,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:12,205 INFO L124 PetriNetUnfolderBase]: 432/782 cut-off events. [2024-06-28 01:41:12,205 INFO L125 PetriNetUnfolderBase]: For 802/802 co-relation queries the response was YES. [2024-06-28 01:41:12,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 782 events. 432/782 cut-off events. For 802/802 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3978 event pairs, 90 based on Foata normal form. 3/772 useless extension candidates. Maximal degree in co-relation 2294. Up to 597 conditions per place. [2024-06-28 01:41:12,213 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 60 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2024-06-28 01:41:12,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 546 flow [2024-06-28 01:41:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:41:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:41:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-28 01:41:12,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-28 01:41:12,216 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 214 flow. Second operand 6 states and 132 transitions. [2024-06-28 01:41:12,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 546 flow [2024-06-28 01:41:12,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 542 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 01:41:12,225 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 380 flow [2024-06-28 01:41:12,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2024-06-28 01:41:12,230 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-06-28 01:41:12,230 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 380 flow [2024-06-28 01:41:12,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:12,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:12,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:41:12,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:12,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2022209754, now seen corresponding path program 1 times [2024-06-28 01:41:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597302842] [2024-06-28 01:41:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597302842] [2024-06-28 01:41:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597302842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:41:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523640832] [2024-06-28 01:41:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:12,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:41:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:41:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:41:12,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:41:12,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:12,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:12,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:41:12,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:13,296 INFO L124 PetriNetUnfolderBase]: 442/800 cut-off events. [2024-06-28 01:41:13,296 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2024-06-28 01:41:13,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 800 events. 442/800 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4100 event pairs, 50 based on Foata normal form. 6/793 useless extension candidates. Maximal degree in co-relation 2784. Up to 565 conditions per place. [2024-06-28 01:41:13,303 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 63 selfloop transitions, 23 changer transitions 0/95 dead transitions. [2024-06-28 01:41:13,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 95 transitions, 668 flow [2024-06-28 01:41:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:41:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:41:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-28 01:41:13,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6040816326530613 [2024-06-28 01:41:13,304 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 380 flow. Second operand 7 states and 148 transitions. [2024-06-28 01:41:13,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 95 transitions, 668 flow [2024-06-28 01:41:13,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 658 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-28 01:41:13,310 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 433 flow [2024-06-28 01:41:13,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-06-28 01:41:13,311 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-28 01:41:13,311 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 433 flow [2024-06-28 01:41:13,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:13,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:13,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:41:13,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:13,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2007226518, now seen corresponding path program 1 times [2024-06-28 01:41:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883016585] [2024-06-28 01:41:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883016585] [2024-06-28 01:41:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883016585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:13,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:13,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:41:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681421516] [2024-06-28 01:41:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:13,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:41:13,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:41:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:41:13,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:13,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:13,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:13,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:13,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:14,066 INFO L124 PetriNetUnfolderBase]: 515/1024 cut-off events. [2024-06-28 01:41:14,066 INFO L125 PetriNetUnfolderBase]: For 2206/2206 co-relation queries the response was YES. [2024-06-28 01:41:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1024 events. 515/1024 cut-off events. For 2206/2206 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5620 event pairs, 137 based on Foata normal form. 3/986 useless extension candidates. Maximal degree in co-relation 3469. Up to 815 conditions per place. [2024-06-28 01:41:14,075 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 59 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-06-28 01:41:14,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 615 flow [2024-06-28 01:41:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:41:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:41:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-28 01:41:14,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 01:41:14,077 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 433 flow. Second operand 5 states and 87 transitions. [2024-06-28 01:41:14,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 615 flow [2024-06-28 01:41:14,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 560 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 01:41:14,085 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 422 flow [2024-06-28 01:41:14,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-06-28 01:41:14,086 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-28 01:41:14,086 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 422 flow [2024-06-28 01:41:14,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:14,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:14,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:14,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:41:14,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:14,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -504118926, now seen corresponding path program 1 times [2024-06-28 01:41:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514278992] [2024-06-28 01:41:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514278992] [2024-06-28 01:41:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514278992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:41:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995171909] [2024-06-28 01:41:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:14,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:41:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:41:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:41:14,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:14,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:14,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:14,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:14,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:14,907 INFO L124 PetriNetUnfolderBase]: 542/1051 cut-off events. [2024-06-28 01:41:14,908 INFO L125 PetriNetUnfolderBase]: For 2248/2248 co-relation queries the response was YES. [2024-06-28 01:41:14,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1051 events. 542/1051 cut-off events. For 2248/2248 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5651 event pairs, 123 based on Foata normal form. 6/1014 useless extension candidates. Maximal degree in co-relation 3544. Up to 683 conditions per place. [2024-06-28 01:41:14,917 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 66 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-06-28 01:41:14,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 706 flow [2024-06-28 01:41:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:41:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:41:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-28 01:41:14,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-28 01:41:14,919 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 422 flow. Second operand 6 states and 112 transitions. [2024-06-28 01:41:14,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 706 flow [2024-06-28 01:41:14,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 686 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:14,926 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 478 flow [2024-06-28 01:41:14,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-28 01:41:14,928 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2024-06-28 01:41:14,928 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 478 flow [2024-06-28 01:41:14,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:14,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:14,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:14,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:41:14,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:14,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 504388884, now seen corresponding path program 2 times [2024-06-28 01:41:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019939591] [2024-06-28 01:41:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019939591] [2024-06-28 01:41:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019939591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:15,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:41:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968653884] [2024-06-28 01:41:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:15,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:41:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:41:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:41:15,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:15,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:15,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:15,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:15,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:15,729 INFO L124 PetriNetUnfolderBase]: 531/1055 cut-off events. [2024-06-28 01:41:15,729 INFO L125 PetriNetUnfolderBase]: For 2543/2543 co-relation queries the response was YES. [2024-06-28 01:41:15,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1055 events. 531/1055 cut-off events. For 2543/2543 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5858 event pairs, 165 based on Foata normal form. 3/1015 useless extension candidates. Maximal degree in co-relation 3623. Up to 834 conditions per place. [2024-06-28 01:41:15,739 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 64 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-28 01:41:15,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 671 flow [2024-06-28 01:41:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:41:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:41:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-28 01:41:15,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-28 01:41:15,741 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 478 flow. Second operand 6 states and 101 transitions. [2024-06-28 01:41:15,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 671 flow [2024-06-28 01:41:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 648 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:15,751 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 483 flow [2024-06-28 01:41:15,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-28 01:41:15,752 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2024-06-28 01:41:15,752 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 483 flow [2024-06-28 01:41:15,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:15,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:15,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:41:15,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:15,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash 214679785, now seen corresponding path program 1 times [2024-06-28 01:41:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102694882] [2024-06-28 01:41:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:16,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102694882] [2024-06-28 01:41:16,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102694882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:16,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:16,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655526809] [2024-06-28 01:41:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:16,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:16,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:16,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 483 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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-28 01:41:16,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:16,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:16,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:17,058 INFO L124 PetriNetUnfolderBase]: 533/1070 cut-off events. [2024-06-28 01:41:17,059 INFO L125 PetriNetUnfolderBase]: For 2998/2998 co-relation queries the response was YES. [2024-06-28 01:41:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 1070 events. 533/1070 cut-off events. For 2998/2998 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5988 event pairs, 252 based on Foata normal form. 2/1029 useless extension candidates. Maximal degree in co-relation 3635. Up to 831 conditions per place. [2024-06-28 01:41:17,068 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 69 selfloop transitions, 15 changer transitions 0/91 dead transitions. [2024-06-28 01:41:17,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 748 flow [2024-06-28 01:41:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-28 01:41:17,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 01:41:17,070 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 483 flow. Second operand 8 states and 126 transitions. [2024-06-28 01:41:17,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 748 flow [2024-06-28 01:41:17,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 691 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:17,078 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 535 flow [2024-06-28 01:41:17,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=535, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2024-06-28 01:41:17,080 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-06-28 01:41:17,080 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 535 flow [2024-06-28 01:41:17,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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-28 01:41:17,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:17,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:17,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:41:17,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:17,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1758190160, now seen corresponding path program 1 times [2024-06-28 01:41:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618985581] [2024-06-28 01:41:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:18,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618985581] [2024-06-28 01:41:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618985581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248266550] [2024-06-28 01:41:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:18,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:18,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 535 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:18,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:18,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:18,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:18,780 INFO L124 PetriNetUnfolderBase]: 530/1069 cut-off events. [2024-06-28 01:41:18,781 INFO L125 PetriNetUnfolderBase]: For 2796/2796 co-relation queries the response was YES. [2024-06-28 01:41:18,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 1069 events. 530/1069 cut-off events. For 2796/2796 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6006 event pairs, 251 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 3699. Up to 814 conditions per place. [2024-06-28 01:41:18,790 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 71 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2024-06-28 01:41:18,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 759 flow [2024-06-28 01:41:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:41:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:41:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 01:41:18,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-28 01:41:18,792 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 535 flow. Second operand 7 states and 117 transitions. [2024-06-28 01:41:18,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 94 transitions, 759 flow [2024-06-28 01:41:18,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 718 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:41:18,805 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 531 flow [2024-06-28 01:41:18,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2024-06-28 01:41:18,805 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 37 predicate places. [2024-06-28 01:41:18,806 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 531 flow [2024-06-28 01:41:18,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:18,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:18,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:18,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:41:18,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:18,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1876638863, now seen corresponding path program 1 times [2024-06-28 01:41:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524093009] [2024-06-28 01:41:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524093009] [2024-06-28 01:41:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524093009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188765521] [2024-06-28 01:41:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:19,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:19,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:19,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 531 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:19,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:19,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:19,876 INFO L124 PetriNetUnfolderBase]: 641/1174 cut-off events. [2024-06-28 01:41:19,876 INFO L125 PetriNetUnfolderBase]: For 3321/3321 co-relation queries the response was YES. [2024-06-28 01:41:19,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 1174 events. 641/1174 cut-off events. For 3321/3321 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6392 event pairs, 104 based on Foata normal form. 1/1148 useless extension candidates. Maximal degree in co-relation 4390. Up to 850 conditions per place. [2024-06-28 01:41:19,886 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 94 selfloop transitions, 29 changer transitions 0/130 dead transitions. [2024-06-28 01:41:19,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 130 transitions, 1102 flow [2024-06-28 01:41:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 01:41:19,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-06-28 01:41:19,888 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 531 flow. Second operand 8 states and 145 transitions. [2024-06-28 01:41:19,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 130 transitions, 1102 flow [2024-06-28 01:41:19,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 130 transitions, 1049 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:19,898 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 707 flow [2024-06-28 01:41:19,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=707, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2024-06-28 01:41:19,899 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2024-06-28 01:41:19,899 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 707 flow [2024-06-28 01:41:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:19,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:19,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:41:19,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:19,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2083094123, now seen corresponding path program 2 times [2024-06-28 01:41:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754392550] [2024-06-28 01:41:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:19,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:20,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754392550] [2024-06-28 01:41:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754392550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:20,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:20,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:20,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571341170] [2024-06-28 01:41:20,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:20,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:20,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:20,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:20,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:20,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:20,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 707 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:20,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:20,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:20,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:21,255 INFO L124 PetriNetUnfolderBase]: 790/1501 cut-off events. [2024-06-28 01:41:21,255 INFO L125 PetriNetUnfolderBase]: For 4592/4592 co-relation queries the response was YES. [2024-06-28 01:41:21,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5894 conditions, 1501 events. 790/1501 cut-off events. For 4592/4592 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8821 event pairs, 148 based on Foata normal form. 3/1449 useless extension candidates. Maximal degree in co-relation 5857. Up to 967 conditions per place. [2024-06-28 01:41:21,269 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 108 selfloop transitions, 33 changer transitions 0/148 dead transitions. [2024-06-28 01:41:21,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 148 transitions, 1340 flow [2024-06-28 01:41:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:41:21,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-28 01:41:21,271 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 707 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:41:21,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 148 transitions, 1340 flow [2024-06-28 01:41:21,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 148 transitions, 1304 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:21,285 INFO L231 Difference]: Finished difference. Result has 89 places, 109 transitions, 952 flow [2024-06-28 01:41:21,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=952, PETRI_PLACES=89, PETRI_TRANSITIONS=109} [2024-06-28 01:41:21,286 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2024-06-28 01:41:21,286 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 109 transitions, 952 flow [2024-06-28 01:41:21,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:21,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:21,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:41:21,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:21,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1831177757, now seen corresponding path program 3 times [2024-06-28 01:41:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:21,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832231297] [2024-06-28 01:41:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:21,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832231297] [2024-06-28 01:41:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832231297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:21,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:21,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:41:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626479447] [2024-06-28 01:41:21,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:21,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:41:21,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:41:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:41:21,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:21,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 109 transitions, 952 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-28 01:41:21,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:21,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:21,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:22,205 INFO L124 PetriNetUnfolderBase]: 827/1512 cut-off events. [2024-06-28 01:41:22,205 INFO L125 PetriNetUnfolderBase]: For 5782/5782 co-relation queries the response was YES. [2024-06-28 01:41:22,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6653 conditions, 1512 events. 827/1512 cut-off events. For 5782/5782 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8697 event pairs, 125 based on Foata normal form. 1/1475 useless extension candidates. Maximal degree in co-relation 6611. Up to 1027 conditions per place. [2024-06-28 01:41:22,220 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 96 selfloop transitions, 45 changer transitions 0/148 dead transitions. [2024-06-28 01:41:22,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 148 transitions, 1475 flow [2024-06-28 01:41:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:41:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:41:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-28 01:41:22,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-06-28 01:41:22,221 INFO L175 Difference]: Start difference. First operand has 89 places, 109 transitions, 952 flow. Second operand 7 states and 131 transitions. [2024-06-28 01:41:22,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 148 transitions, 1475 flow [2024-06-28 01:41:22,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 148 transitions, 1454 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:22,240 INFO L231 Difference]: Finished difference. Result has 96 places, 121 transitions, 1181 flow [2024-06-28 01:41:22,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1181, PETRI_PLACES=96, PETRI_TRANSITIONS=121} [2024-06-28 01:41:22,241 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 57 predicate places. [2024-06-28 01:41:22,241 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 1181 flow [2024-06-28 01:41:22,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-28 01:41:22,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:22,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:22,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:41:22,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:22,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash 869231217, now seen corresponding path program 4 times [2024-06-28 01:41:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:22,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974939403] [2024-06-28 01:41:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:22,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:22,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974939403] [2024-06-28 01:41:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974939403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992184180] [2024-06-28 01:41:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:22,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:22,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:22,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 121 transitions, 1181 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:22,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:22,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:22,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:23,317 INFO L124 PetriNetUnfolderBase]: 845/1544 cut-off events. [2024-06-28 01:41:23,318 INFO L125 PetriNetUnfolderBase]: For 7361/7361 co-relation queries the response was YES. [2024-06-28 01:41:23,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7393 conditions, 1544 events. 845/1544 cut-off events. For 7361/7361 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8988 event pairs, 120 based on Foata normal form. 1/1506 useless extension candidates. Maximal degree in co-relation 7347. Up to 1047 conditions per place. [2024-06-28 01:41:23,336 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 93 selfloop transitions, 52 changer transitions 0/152 dead transitions. [2024-06-28 01:41:23,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 152 transitions, 1651 flow [2024-06-28 01:41:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:41:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:41:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 01:41:23,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 01:41:23,338 INFO L175 Difference]: Start difference. First operand has 96 places, 121 transitions, 1181 flow. Second operand 7 states and 128 transitions. [2024-06-28 01:41:23,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 152 transitions, 1651 flow [2024-06-28 01:41:23,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 1616 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:23,368 INFO L231 Difference]: Finished difference. Result has 100 places, 125 transitions, 1313 flow [2024-06-28 01:41:23,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1313, PETRI_PLACES=100, PETRI_TRANSITIONS=125} [2024-06-28 01:41:23,368 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 61 predicate places. [2024-06-28 01:41:23,368 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 125 transitions, 1313 flow [2024-06-28 01:41:23,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:23,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:23,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:23,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:41:23,369 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:23,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash 17765883, now seen corresponding path program 5 times [2024-06-28 01:41:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127696182] [2024-06-28 01:41:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127696182] [2024-06-28 01:41:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127696182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:23,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029814665] [2024-06-28 01:41:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:23,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:24,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:24,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 125 transitions, 1313 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:24,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:24,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:24,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:24,441 INFO L124 PetriNetUnfolderBase]: 846/1554 cut-off events. [2024-06-28 01:41:24,441 INFO L125 PetriNetUnfolderBase]: For 7806/7806 co-relation queries the response was YES. [2024-06-28 01:41:24,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7689 conditions, 1554 events. 846/1554 cut-off events. For 7806/7806 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9027 event pairs, 119 based on Foata normal form. 1/1513 useless extension candidates. Maximal degree in co-relation 7642. Up to 1148 conditions per place. [2024-06-28 01:41:24,459 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 101 selfloop transitions, 48 changer transitions 0/156 dead transitions. [2024-06-28 01:41:24,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 1799 flow [2024-06-28 01:41:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:41:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:41:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-28 01:41:24,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-28 01:41:24,462 INFO L175 Difference]: Start difference. First operand has 100 places, 125 transitions, 1313 flow. Second operand 7 states and 124 transitions. [2024-06-28 01:41:24,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 156 transitions, 1799 flow [2024-06-28 01:41:24,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 156 transitions, 1704 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:41:24,486 INFO L231 Difference]: Finished difference. Result has 104 places, 130 transitions, 1419 flow [2024-06-28 01:41:24,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1419, PETRI_PLACES=104, PETRI_TRANSITIONS=130} [2024-06-28 01:41:24,486 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 65 predicate places. [2024-06-28 01:41:24,487 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 130 transitions, 1419 flow [2024-06-28 01:41:24,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:24,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:24,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:24,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:41:24,488 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:24,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -605311874, now seen corresponding path program 1 times [2024-06-28 01:41:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442867677] [2024-06-28 01:41:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442867677] [2024-06-28 01:41:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442867677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800946286] [2024-06-28 01:41:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:25,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:25,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:25,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 130 transitions, 1419 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:25,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:25,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:25,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:25,770 INFO L124 PetriNetUnfolderBase]: 848/1603 cut-off events. [2024-06-28 01:41:25,770 INFO L125 PetriNetUnfolderBase]: For 8172/8178 co-relation queries the response was YES. [2024-06-28 01:41:25,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 1603 events. 848/1603 cut-off events. For 8172/8178 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9662 event pairs, 157 based on Foata normal form. 8/1553 useless extension candidates. Maximal degree in co-relation 7752. Up to 898 conditions per place. [2024-06-28 01:41:25,786 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 108 selfloop transitions, 42 changer transitions 0/157 dead transitions. [2024-06-28 01:41:25,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 157 transitions, 1847 flow [2024-06-28 01:41:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:41:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:41:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-28 01:41:25,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-06-28 01:41:25,789 INFO L175 Difference]: Start difference. First operand has 104 places, 130 transitions, 1419 flow. Second operand 6 states and 116 transitions. [2024-06-28 01:41:25,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 157 transitions, 1847 flow [2024-06-28 01:41:25,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 157 transitions, 1763 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:41:25,816 INFO L231 Difference]: Finished difference. Result has 106 places, 132 transitions, 1460 flow [2024-06-28 01:41:25,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1460, PETRI_PLACES=106, PETRI_TRANSITIONS=132} [2024-06-28 01:41:25,817 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 67 predicate places. [2024-06-28 01:41:25,817 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 132 transitions, 1460 flow [2024-06-28 01:41:25,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:25,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:25,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:25,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:41:25,818 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:25,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1833766706, now seen corresponding path program 1 times [2024-06-28 01:41:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681763126] [2024-06-28 01:41:25,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681763126] [2024-06-28 01:41:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681763126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:26,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420138140] [2024-06-28 01:41:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:26,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:26,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:26,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:26,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 132 transitions, 1460 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:26,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:26,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:26,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:27,090 INFO L124 PetriNetUnfolderBase]: 916/1709 cut-off events. [2024-06-28 01:41:27,091 INFO L125 PetriNetUnfolderBase]: For 10684/10684 co-relation queries the response was YES. [2024-06-28 01:41:27,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8528 conditions, 1709 events. 916/1709 cut-off events. For 10684/10684 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10411 event pairs, 143 based on Foata normal form. 2/1664 useless extension candidates. Maximal degree in co-relation 8478. Up to 1164 conditions per place. [2024-06-28 01:41:27,109 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 133 selfloop transitions, 41 changer transitions 0/181 dead transitions. [2024-06-28 01:41:27,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 2132 flow [2024-06-28 01:41:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 01:41:27,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-28 01:41:27,111 INFO L175 Difference]: Start difference. First operand has 106 places, 132 transitions, 1460 flow. Second operand 9 states and 163 transitions. [2024-06-28 01:41:27,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 2132 flow [2024-06-28 01:41:27,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 181 transitions, 2054 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 01:41:27,141 INFO L231 Difference]: Finished difference. Result has 112 places, 136 transitions, 1522 flow [2024-06-28 01:41:27,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1522, PETRI_PLACES=112, PETRI_TRANSITIONS=136} [2024-06-28 01:41:27,142 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 73 predicate places. [2024-06-28 01:41:27,142 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 136 transitions, 1522 flow [2024-06-28 01:41:27,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:27,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:27,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:27,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:41:27,143 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:27,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash -115839482, now seen corresponding path program 1 times [2024-06-28 01:41:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913938458] [2024-06-28 01:41:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913938458] [2024-06-28 01:41:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913938458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:27,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456374365] [2024-06-28 01:41:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:27,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:27,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:28,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:28,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 136 transitions, 1522 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:28,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:28,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:28,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:28,765 INFO L124 PetriNetUnfolderBase]: 1048/2003 cut-off events. [2024-06-28 01:41:28,765 INFO L125 PetriNetUnfolderBase]: For 12140/12140 co-relation queries the response was YES. [2024-06-28 01:41:28,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9694 conditions, 2003 events. 1048/2003 cut-off events. For 12140/12140 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12777 event pairs, 183 based on Foata normal form. 2/1937 useless extension candidates. Maximal degree in co-relation 9642. Up to 978 conditions per place. [2024-06-28 01:41:28,784 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 147 selfloop transitions, 60 changer transitions 0/214 dead transitions. [2024-06-28 01:41:28,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 214 transitions, 2501 flow [2024-06-28 01:41:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 01:41:28,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 01:41:28,789 INFO L175 Difference]: Start difference. First operand has 112 places, 136 transitions, 1522 flow. Second operand 9 states and 170 transitions. [2024-06-28 01:41:28,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 214 transitions, 2501 flow [2024-06-28 01:41:28,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 214 transitions, 2439 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:41:28,821 INFO L231 Difference]: Finished difference. Result has 117 places, 160 transitions, 1845 flow [2024-06-28 01:41:28,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1845, PETRI_PLACES=117, PETRI_TRANSITIONS=160} [2024-06-28 01:41:28,822 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 78 predicate places. [2024-06-28 01:41:28,822 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 160 transitions, 1845 flow [2024-06-28 01:41:28,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:28,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:28,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:28,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:41:28,823 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:28,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -115839606, now seen corresponding path program 2 times [2024-06-28 01:41:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265511525] [2024-06-28 01:41:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265511525] [2024-06-28 01:41:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265511525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566244313] [2024-06-28 01:41:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:29,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:29,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:29,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 160 transitions, 1845 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:29,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:29,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:29,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:30,102 INFO L124 PetriNetUnfolderBase]: 1064/2011 cut-off events. [2024-06-28 01:41:30,103 INFO L125 PetriNetUnfolderBase]: For 13649/13649 co-relation queries the response was YES. [2024-06-28 01:41:30,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10425 conditions, 2011 events. 1064/2011 cut-off events. For 13649/13649 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12730 event pairs, 205 based on Foata normal form. 2/1952 useless extension candidates. Maximal degree in co-relation 10370. Up to 1487 conditions per place. [2024-06-28 01:41:30,121 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 157 selfloop transitions, 39 changer transitions 0/203 dead transitions. [2024-06-28 01:41:30,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 203 transitions, 2509 flow [2024-06-28 01:41:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:41:30,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-28 01:41:30,125 INFO L175 Difference]: Start difference. First operand has 117 places, 160 transitions, 1845 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:41:30,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 203 transitions, 2509 flow [2024-06-28 01:41:30,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 203 transitions, 2460 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:30,168 INFO L231 Difference]: Finished difference. Result has 123 places, 161 transitions, 1889 flow [2024-06-28 01:41:30,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1889, PETRI_PLACES=123, PETRI_TRANSITIONS=161} [2024-06-28 01:41:30,169 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2024-06-28 01:41:30,169 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 161 transitions, 1889 flow [2024-06-28 01:41:30,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:30,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:30,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:30,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:41:30,170 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:30,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:30,170 INFO L85 PathProgramCache]: Analyzing trace with hash 888828234, now seen corresponding path program 3 times [2024-06-28 01:41:30,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:30,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451978623] [2024-06-28 01:41:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:30,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:30,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451978623] [2024-06-28 01:41:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451978623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:30,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:30,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634955840] [2024-06-28 01:41:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:30,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:30,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:30,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:30,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:30,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 161 transitions, 1889 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:30,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:30,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:30,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:31,529 INFO L124 PetriNetUnfolderBase]: 1071/2015 cut-off events. [2024-06-28 01:41:31,529 INFO L125 PetriNetUnfolderBase]: For 13966/13966 co-relation queries the response was YES. [2024-06-28 01:41:31,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10555 conditions, 2015 events. 1071/2015 cut-off events. For 13966/13966 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12732 event pairs, 172 based on Foata normal form. 2/1957 useless extension candidates. Maximal degree in co-relation 10498. Up to 1542 conditions per place. [2024-06-28 01:41:31,545 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 161 selfloop transitions, 35 changer transitions 0/203 dead transitions. [2024-06-28 01:41:31,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 203 transitions, 2551 flow [2024-06-28 01:41:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 01:41:31,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-28 01:41:31,547 INFO L175 Difference]: Start difference. First operand has 123 places, 161 transitions, 1889 flow. Second operand 9 states and 159 transitions. [2024-06-28 01:41:31,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 203 transitions, 2551 flow [2024-06-28 01:41:31,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 203 transitions, 2473 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 01:41:31,588 INFO L231 Difference]: Finished difference. Result has 125 places, 162 transitions, 1898 flow [2024-06-28 01:41:31,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1898, PETRI_PLACES=125, PETRI_TRANSITIONS=162} [2024-06-28 01:41:31,589 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 86 predicate places. [2024-06-28 01:41:31,589 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 162 transitions, 1898 flow [2024-06-28 01:41:31,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:31,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:31,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:31,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:41:31,590 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:31,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 856654078, now seen corresponding path program 2 times [2024-06-28 01:41:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302113943] [2024-06-28 01:41:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:32,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:32,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302113943] [2024-06-28 01:41:32,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302113943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:32,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:32,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:32,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008144466] [2024-06-28 01:41:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:32,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:32,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:32,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:32,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 162 transitions, 1898 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:32,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:32,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:32,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:33,095 INFO L124 PetriNetUnfolderBase]: 1093/2057 cut-off events. [2024-06-28 01:41:33,095 INFO L125 PetriNetUnfolderBase]: For 14678/14678 co-relation queries the response was YES. [2024-06-28 01:41:33,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 2057 events. 1093/2057 cut-off events. For 14678/14678 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12998 event pairs, 140 based on Foata normal form. 2/1997 useless extension candidates. Maximal degree in co-relation 10687. Up to 1174 conditions per place. [2024-06-28 01:41:33,118 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 152 selfloop transitions, 58 changer transitions 0/217 dead transitions. [2024-06-28 01:41:33,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 217 transitions, 2681 flow [2024-06-28 01:41:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 01:41:33,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 01:41:33,120 INFO L175 Difference]: Start difference. First operand has 125 places, 162 transitions, 1898 flow. Second operand 9 states and 170 transitions. [2024-06-28 01:41:33,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 217 transitions, 2681 flow [2024-06-28 01:41:33,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 217 transitions, 2618 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:41:33,164 INFO L231 Difference]: Finished difference. Result has 129 places, 164 transitions, 1984 flow [2024-06-28 01:41:33,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1984, PETRI_PLACES=129, PETRI_TRANSITIONS=164} [2024-06-28 01:41:33,165 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 90 predicate places. [2024-06-28 01:41:33,165 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 164 transitions, 1984 flow [2024-06-28 01:41:33,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:33,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:33,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:33,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:41:33,166 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:33,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash -380260116, now seen corresponding path program 4 times [2024-06-28 01:41:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998783853] [2024-06-28 01:41:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:33,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:33,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998783853] [2024-06-28 01:41:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998783853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556847910] [2024-06-28 01:41:33,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:33,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:33,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:33,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:33,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 164 transitions, 1984 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:33,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:33,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:33,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:34,241 INFO L124 PetriNetUnfolderBase]: 1206/2322 cut-off events. [2024-06-28 01:41:34,242 INFO L125 PetriNetUnfolderBase]: For 17186/17186 co-relation queries the response was YES. [2024-06-28 01:41:34,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 2322 events. 1206/2322 cut-off events. For 17186/17186 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15521 event pairs, 184 based on Foata normal form. 2/2251 useless extension candidates. Maximal degree in co-relation 11856. Up to 1262 conditions per place. [2024-06-28 01:41:34,263 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 137 selfloop transitions, 63 changer transitions 0/207 dead transitions. [2024-06-28 01:41:34,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 207 transitions, 2657 flow [2024-06-28 01:41:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 01:41:34,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-28 01:41:34,265 INFO L175 Difference]: Start difference. First operand has 129 places, 164 transitions, 1984 flow. Second operand 8 states and 142 transitions. [2024-06-28 01:41:34,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 207 transitions, 2657 flow [2024-06-28 01:41:34,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 207 transitions, 2529 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 01:41:34,314 INFO L231 Difference]: Finished difference. Result has 132 places, 175 transitions, 2123 flow [2024-06-28 01:41:34,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2123, PETRI_PLACES=132, PETRI_TRANSITIONS=175} [2024-06-28 01:41:34,315 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 93 predicate places. [2024-06-28 01:41:34,315 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 175 transitions, 2123 flow [2024-06-28 01:41:34,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:34,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:34,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:34,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:41:34,316 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:34,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash -964313690, now seen corresponding path program 5 times [2024-06-28 01:41:34,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:34,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338923230] [2024-06-28 01:41:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:34,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:34,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338923230] [2024-06-28 01:41:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338923230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:34,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545964336] [2024-06-28 01:41:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:34,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:34,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:34,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:34,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 175 transitions, 2123 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:34,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:34,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:34,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:35,376 INFO L124 PetriNetUnfolderBase]: 1308/2544 cut-off events. [2024-06-28 01:41:35,376 INFO L125 PetriNetUnfolderBase]: For 20436/20436 co-relation queries the response was YES. [2024-06-28 01:41:35,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13272 conditions, 2544 events. 1308/2544 cut-off events. For 20436/20436 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17614 event pairs, 227 based on Foata normal form. 2/2465 useless extension candidates. Maximal degree in co-relation 13210. Up to 1486 conditions per place. [2024-06-28 01:41:35,396 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 143 selfloop transitions, 68 changer transitions 0/218 dead transitions. [2024-06-28 01:41:35,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 218 transitions, 2893 flow [2024-06-28 01:41:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:41:35,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-28 01:41:35,397 INFO L175 Difference]: Start difference. First operand has 132 places, 175 transitions, 2123 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:41:35,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 218 transitions, 2893 flow [2024-06-28 01:41:35,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 218 transitions, 2730 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-28 01:41:35,442 INFO L231 Difference]: Finished difference. Result has 136 places, 183 transitions, 2260 flow [2024-06-28 01:41:35,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2260, PETRI_PLACES=136, PETRI_TRANSITIONS=183} [2024-06-28 01:41:35,442 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2024-06-28 01:41:35,442 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 183 transitions, 2260 flow [2024-06-28 01:41:35,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:35,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:35,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:35,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:41:35,443 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:35,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1972170484, now seen corresponding path program 3 times [2024-06-28 01:41:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689483936] [2024-06-28 01:41:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:36,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689483936] [2024-06-28 01:41:36,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689483936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607252363] [2024-06-28 01:41:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:36,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:36,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:36,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 183 transitions, 2260 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:36,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:36,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:36,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:36,890 INFO L124 PetriNetUnfolderBase]: 1467/3107 cut-off events. [2024-06-28 01:41:36,890 INFO L125 PetriNetUnfolderBase]: For 23470/23470 co-relation queries the response was YES. [2024-06-28 01:41:36,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15119 conditions, 3107 events. 1467/3107 cut-off events. For 23470/23470 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 23712 event pairs, 263 based on Foata normal form. 2/2950 useless extension candidates. Maximal degree in co-relation 15056. Up to 1621 conditions per place. [2024-06-28 01:41:36,912 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 209 selfloop transitions, 93 changer transitions 0/309 dead transitions. [2024-06-28 01:41:36,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 309 transitions, 4244 flow [2024-06-28 01:41:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 01:41:36,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:41:36,913 INFO L175 Difference]: Start difference. First operand has 136 places, 183 transitions, 2260 flow. Second operand 9 states and 171 transitions. [2024-06-28 01:41:36,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 309 transitions, 4244 flow [2024-06-28 01:41:36,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 309 transitions, 4147 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 01:41:36,966 INFO L231 Difference]: Finished difference. Result has 144 places, 241 transitions, 3284 flow [2024-06-28 01:41:36,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2191, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3284, PETRI_PLACES=144, PETRI_TRANSITIONS=241} [2024-06-28 01:41:36,967 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 105 predicate places. [2024-06-28 01:41:36,967 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 241 transitions, 3284 flow [2024-06-28 01:41:36,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:36,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:36,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:36,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:41:36,968 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:36,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2004489038, now seen corresponding path program 6 times [2024-06-28 01:41:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:36,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663421320] [2024-06-28 01:41:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663421320] [2024-06-28 01:41:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663421320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:41:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378882144] [2024-06-28 01:41:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:37,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:41:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:41:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:41:37,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:37,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 241 transitions, 3284 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:37,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:37,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:37,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:38,203 INFO L124 PetriNetUnfolderBase]: 1474/2979 cut-off events. [2024-06-28 01:41:38,203 INFO L125 PetriNetUnfolderBase]: For 25650/25650 co-relation queries the response was YES. [2024-06-28 01:41:38,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16377 conditions, 2979 events. 1474/2979 cut-off events. For 25650/25650 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21734 event pairs, 312 based on Foata normal form. 2/2856 useless extension candidates. Maximal degree in co-relation 16309. Up to 1968 conditions per place. [2024-06-28 01:41:38,227 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 201 selfloop transitions, 72 changer transitions 0/280 dead transitions. [2024-06-28 01:41:38,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 280 transitions, 4132 flow [2024-06-28 01:41:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-28 01:41:38,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2024-06-28 01:41:38,228 INFO L175 Difference]: Start difference. First operand has 144 places, 241 transitions, 3284 flow. Second operand 8 states and 146 transitions. [2024-06-28 01:41:38,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 280 transitions, 4132 flow [2024-06-28 01:41:38,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 280 transitions, 4001 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:38,341 INFO L231 Difference]: Finished difference. Result has 149 places, 242 transitions, 3372 flow [2024-06-28 01:41:38,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3197, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3372, PETRI_PLACES=149, PETRI_TRANSITIONS=242} [2024-06-28 01:41:38,342 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 110 predicate places. [2024-06-28 01:41:38,342 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 242 transitions, 3372 flow [2024-06-28 01:41:38,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:38,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:38,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:38,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:41:38,343 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:38,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash -280948190, now seen corresponding path program 4 times [2024-06-28 01:41:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:38,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097053201] [2024-06-28 01:41:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:38,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097053201] [2024-06-28 01:41:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097053201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:39,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:39,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411283520] [2024-06-28 01:41:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:39,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:39,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:39,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:39,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:39,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 242 transitions, 3372 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:39,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:39,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:39,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:39,913 INFO L124 PetriNetUnfolderBase]: 1611/3325 cut-off events. [2024-06-28 01:41:39,913 INFO L125 PetriNetUnfolderBase]: For 30142/30142 co-relation queries the response was YES. [2024-06-28 01:41:39,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18283 conditions, 3325 events. 1611/3325 cut-off events. For 30142/30142 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 25322 event pairs, 359 based on Foata normal form. 2/3171 useless extension candidates. Maximal degree in co-relation 18213. Up to 1927 conditions per place. [2024-06-28 01:41:39,937 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 217 selfloop transitions, 107 changer transitions 0/331 dead transitions. [2024-06-28 01:41:39,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 331 transitions, 4988 flow [2024-06-28 01:41:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-28 01:41:39,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-06-28 01:41:39,938 INFO L175 Difference]: Start difference. First operand has 149 places, 242 transitions, 3372 flow. Second operand 9 states and 174 transitions. [2024-06-28 01:41:39,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 331 transitions, 4988 flow [2024-06-28 01:41:40,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 331 transitions, 4838 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:40,017 INFO L231 Difference]: Finished difference. Result has 155 places, 279 transitions, 4181 flow [2024-06-28 01:41:40,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3238, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4181, PETRI_PLACES=155, PETRI_TRANSITIONS=279} [2024-06-28 01:41:40,017 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-28 01:41:40,017 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 279 transitions, 4181 flow [2024-06-28 01:41:40,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:40,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:40,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:40,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:41:40,018 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:40,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash -309571730, now seen corresponding path program 5 times [2024-06-28 01:41:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723391653] [2024-06-28 01:41:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:40,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723391653] [2024-06-28 01:41:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723391653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519499290] [2024-06-28 01:41:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:40,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:40,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:40,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 279 transitions, 4181 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:40,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:40,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:40,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:41,638 INFO L124 PetriNetUnfolderBase]: 1669/3475 cut-off events. [2024-06-28 01:41:41,638 INFO L125 PetriNetUnfolderBase]: For 34838/34838 co-relation queries the response was YES. [2024-06-28 01:41:41,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 3475 events. 1669/3475 cut-off events. For 34838/34838 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 26896 event pairs, 441 based on Foata normal form. 2/3303 useless extension candidates. Maximal degree in co-relation 19557. Up to 2232 conditions per place. [2024-06-28 01:41:41,666 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 250 selfloop transitions, 79 changer transitions 0/336 dead transitions. [2024-06-28 01:41:41,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 336 transitions, 5348 flow [2024-06-28 01:41:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:41:41,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2024-06-28 01:41:41,673 INFO L175 Difference]: Start difference. First operand has 155 places, 279 transitions, 4181 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:41:41,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 336 transitions, 5348 flow [2024-06-28 01:41:41,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 336 transitions, 5246 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:41,772 INFO L231 Difference]: Finished difference. Result has 163 places, 292 transitions, 4531 flow [2024-06-28 01:41:41,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4085, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4531, PETRI_PLACES=163, PETRI_TRANSITIONS=292} [2024-06-28 01:41:41,773 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 124 predicate places. [2024-06-28 01:41:41,773 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 292 transitions, 4531 flow [2024-06-28 01:41:41,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:41,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:41,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:41,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:41:41,774 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:41,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash -309398750, now seen corresponding path program 6 times [2024-06-28 01:41:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430694172] [2024-06-28 01:41:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430694172] [2024-06-28 01:41:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430694172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879577786] [2024-06-28 01:41:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:42,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:42,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:42,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 292 transitions, 4531 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:42,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:42,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:42,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:43,503 INFO L124 PetriNetUnfolderBase]: 1716/3548 cut-off events. [2024-06-28 01:41:43,504 INFO L125 PetriNetUnfolderBase]: For 36473/36473 co-relation queries the response was YES. [2024-06-28 01:41:43,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20532 conditions, 3548 events. 1716/3548 cut-off events. For 36473/36473 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27366 event pairs, 358 based on Foata normal form. 2/3380 useless extension candidates. Maximal degree in co-relation 20454. Up to 2228 conditions per place. [2024-06-28 01:41:43,534 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 259 selfloop transitions, 95 changer transitions 0/361 dead transitions. [2024-06-28 01:41:43,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 361 transitions, 5881 flow [2024-06-28 01:41:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:41:43,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:41:43,535 INFO L175 Difference]: Start difference. First operand has 163 places, 292 transitions, 4531 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:41:43,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 361 transitions, 5881 flow [2024-06-28 01:41:43,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 361 transitions, 5677 flow, removed 67 selfloop flow, removed 3 redundant places. [2024-06-28 01:41:43,643 INFO L231 Difference]: Finished difference. Result has 173 places, 316 transitions, 5023 flow [2024-06-28 01:41:43,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4355, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5023, PETRI_PLACES=173, PETRI_TRANSITIONS=316} [2024-06-28 01:41:43,644 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 134 predicate places. [2024-06-28 01:41:43,644 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 316 transitions, 5023 flow [2024-06-28 01:41:43,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:43,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:43,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:41:43,645 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:43,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash -309391806, now seen corresponding path program 1 times [2024-06-28 01:41:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:43,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520392321] [2024-06-28 01:41:43,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520392321] [2024-06-28 01:41:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520392321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:44,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:41:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929034037] [2024-06-28 01:41:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:44,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:41:44,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:44,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:41:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:41:44,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:44,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 316 transitions, 5023 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:44,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:44,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:44,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:45,494 INFO L124 PetriNetUnfolderBase]: 1748/3634 cut-off events. [2024-06-28 01:41:45,494 INFO L125 PetriNetUnfolderBase]: For 40486/40486 co-relation queries the response was YES. [2024-06-28 01:41:45,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21406 conditions, 3634 events. 1748/3634 cut-off events. For 40486/40486 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 28227 event pairs, 419 based on Foata normal form. 4/3461 useless extension candidates. Maximal degree in co-relation 21323. Up to 2355 conditions per place. [2024-06-28 01:41:45,527 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 280 selfloop transitions, 72 changer transitions 0/359 dead transitions. [2024-06-28 01:41:45,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 359 transitions, 6021 flow [2024-06-28 01:41:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:41:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:41:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-28 01:41:45,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-06-28 01:41:45,529 INFO L175 Difference]: Start difference. First operand has 173 places, 316 transitions, 5023 flow. Second operand 9 states and 164 transitions. [2024-06-28 01:41:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 359 transitions, 6021 flow [2024-06-28 01:41:45,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 359 transitions, 5887 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:45,632 INFO L231 Difference]: Finished difference. Result has 180 places, 318 transitions, 5063 flow [2024-06-28 01:41:45,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4889, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5063, PETRI_PLACES=180, PETRI_TRANSITIONS=318} [2024-06-28 01:41:45,633 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 141 predicate places. [2024-06-28 01:41:45,634 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 318 transitions, 5063 flow [2024-06-28 01:41:45,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:45,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:45,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:45,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:41:45,634 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:45,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash 547886222, now seen corresponding path program 7 times [2024-06-28 01:41:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163429736] [2024-06-28 01:41:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163429736] [2024-06-28 01:41:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163429736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113850521] [2024-06-28 01:41:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:46,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:46,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:46,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:46,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 318 transitions, 5063 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:46,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:46,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:46,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:47,057 INFO L124 PetriNetUnfolderBase]: 1774/3587 cut-off events. [2024-06-28 01:41:47,057 INFO L125 PetriNetUnfolderBase]: For 42506/42506 co-relation queries the response was YES. [2024-06-28 01:41:47,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21487 conditions, 3587 events. 1774/3587 cut-off events. For 42506/42506 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27057 event pairs, 263 based on Foata normal form. 2/3435 useless extension candidates. Maximal degree in co-relation 21402. Up to 1915 conditions per place. [2024-06-28 01:41:47,090 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 244 selfloop transitions, 105 changer transitions 0/356 dead transitions. [2024-06-28 01:41:47,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 356 transitions, 6037 flow [2024-06-28 01:41:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 01:41:47,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2024-06-28 01:41:47,091 INFO L175 Difference]: Start difference. First operand has 180 places, 318 transitions, 5063 flow. Second operand 8 states and 143 transitions. [2024-06-28 01:41:47,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 356 transitions, 6037 flow [2024-06-28 01:41:47,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 356 transitions, 5924 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:47,205 INFO L231 Difference]: Finished difference. Result has 182 places, 320 transitions, 5201 flow [2024-06-28 01:41:47,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4950, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5201, PETRI_PLACES=182, PETRI_TRANSITIONS=320} [2024-06-28 01:41:47,205 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 143 predicate places. [2024-06-28 01:41:47,205 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 320 transitions, 5201 flow [2024-06-28 01:41:47,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:47,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:47,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:47,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:41:47,206 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:47,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1176364884, now seen corresponding path program 7 times [2024-06-28 01:41:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724937070] [2024-06-28 01:41:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:47,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724937070] [2024-06-28 01:41:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724937070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705661683] [2024-06-28 01:41:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:47,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:47,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:47,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 320 transitions, 5201 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:47,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:47,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:47,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:48,702 INFO L124 PetriNetUnfolderBase]: 1816/3709 cut-off events. [2024-06-28 01:41:48,703 INFO L125 PetriNetUnfolderBase]: For 45332/45332 co-relation queries the response was YES. [2024-06-28 01:41:48,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22330 conditions, 3709 events. 1816/3709 cut-off events. For 45332/45332 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28380 event pairs, 397 based on Foata normal form. 2/3545 useless extension candidates. Maximal degree in co-relation 22244. Up to 1576 conditions per place. [2024-06-28 01:41:48,737 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 162 selfloop transitions, 199 changer transitions 0/368 dead transitions. [2024-06-28 01:41:48,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 368 transitions, 6319 flow [2024-06-28 01:41:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-28 01:41:48,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-06-28 01:41:48,739 INFO L175 Difference]: Start difference. First operand has 182 places, 320 transitions, 5201 flow. Second operand 8 states and 151 transitions. [2024-06-28 01:41:48,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 368 transitions, 6319 flow [2024-06-28 01:41:48,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 368 transitions, 6152 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:48,868 INFO L231 Difference]: Finished difference. Result has 184 places, 328 transitions, 5577 flow [2024-06-28 01:41:48,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5038, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5577, PETRI_PLACES=184, PETRI_TRANSITIONS=328} [2024-06-28 01:41:48,869 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 145 predicate places. [2024-06-28 01:41:48,869 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 328 transitions, 5577 flow [2024-06-28 01:41:48,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:48,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:48,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:48,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:41:48,870 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:48,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1176364760, now seen corresponding path program 8 times [2024-06-28 01:41:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230660405] [2024-06-28 01:41:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230660405] [2024-06-28 01:41:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230660405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:49,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057090378] [2024-06-28 01:41:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:49,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:49,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:49,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 328 transitions, 5577 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:49,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:49,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:49,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:50,284 INFO L124 PetriNetUnfolderBase]: 1852/3820 cut-off events. [2024-06-28 01:41:50,284 INFO L125 PetriNetUnfolderBase]: For 48328/48328 co-relation queries the response was YES. [2024-06-28 01:41:50,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23172 conditions, 3820 events. 1852/3820 cut-off events. For 48328/48328 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 29577 event pairs, 394 based on Foata normal form. 2/3646 useless extension candidates. Maximal degree in co-relation 23086. Up to 2518 conditions per place. [2024-06-28 01:41:50,325 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 272 selfloop transitions, 88 changer transitions 0/367 dead transitions. [2024-06-28 01:41:50,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 367 transitions, 6546 flow [2024-06-28 01:41:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 01:41:50,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2024-06-28 01:41:50,333 INFO L175 Difference]: Start difference. First operand has 184 places, 328 transitions, 5577 flow. Second operand 8 states and 143 transitions. [2024-06-28 01:41:50,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 367 transitions, 6546 flow [2024-06-28 01:41:50,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 367 transitions, 6337 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:50,474 INFO L231 Difference]: Finished difference. Result has 186 places, 331 transitions, 5609 flow [2024-06-28 01:41:50,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5368, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5609, PETRI_PLACES=186, PETRI_TRANSITIONS=331} [2024-06-28 01:41:50,475 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 147 predicate places. [2024-06-28 01:41:50,475 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 331 transitions, 5609 flow [2024-06-28 01:41:50,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:50,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:50,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:41:50,475 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:50,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1179166044, now seen corresponding path program 8 times [2024-06-28 01:41:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245200627] [2024-06-28 01:41:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:51,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245200627] [2024-06-28 01:41:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245200627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:51,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552363901] [2024-06-28 01:41:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:51,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:51,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:51,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 331 transitions, 5609 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:51,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:51,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:51,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:52,253 INFO L124 PetriNetUnfolderBase]: 1902/3963 cut-off events. [2024-06-28 01:41:52,253 INFO L125 PetriNetUnfolderBase]: For 48377/48377 co-relation queries the response was YES. [2024-06-28 01:41:52,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23948 conditions, 3963 events. 1902/3963 cut-off events. For 48377/48377 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 31305 event pairs, 458 based on Foata normal form. 2/3772 useless extension candidates. Maximal degree in co-relation 23862. Up to 2489 conditions per place. [2024-06-28 01:41:52,369 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 271 selfloop transitions, 98 changer transitions 0/376 dead transitions. [2024-06-28 01:41:52,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 376 transitions, 6755 flow [2024-06-28 01:41:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:41:52,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:41:52,370 INFO L175 Difference]: Start difference. First operand has 186 places, 331 transitions, 5609 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:41:52,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 376 transitions, 6755 flow [2024-06-28 01:41:52,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 376 transitions, 6588 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:52,491 INFO L231 Difference]: Finished difference. Result has 188 places, 341 transitions, 5848 flow [2024-06-28 01:41:52,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5442, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5848, PETRI_PLACES=188, PETRI_TRANSITIONS=341} [2024-06-28 01:41:52,491 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 149 predicate places. [2024-06-28 01:41:52,491 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 341 transitions, 5848 flow [2024-06-28 01:41:52,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:52,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:52,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:52,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:41:52,492 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:52,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1179161394, now seen corresponding path program 9 times [2024-06-28 01:41:52,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:52,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598400804] [2024-06-28 01:41:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598400804] [2024-06-28 01:41:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598400804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:53,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:53,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:53,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841642936] [2024-06-28 01:41:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:53,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:53,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 341 transitions, 5848 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:53,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:53,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:53,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:54,104 INFO L124 PetriNetUnfolderBase]: 1976/4073 cut-off events. [2024-06-28 01:41:54,104 INFO L125 PetriNetUnfolderBase]: For 51246/51246 co-relation queries the response was YES. [2024-06-28 01:41:54,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24930 conditions, 4073 events. 1976/4073 cut-off events. For 51246/51246 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 32083 event pairs, 437 based on Foata normal form. 2/3884 useless extension candidates. Maximal degree in co-relation 24843. Up to 2270 conditions per place. [2024-06-28 01:41:54,142 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 222 selfloop transitions, 167 changer transitions 0/396 dead transitions. [2024-06-28 01:41:54,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 396 transitions, 7166 flow [2024-06-28 01:41:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:41:54,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-28 01:41:54,144 INFO L175 Difference]: Start difference. First operand has 188 places, 341 transitions, 5848 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:41:54,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 396 transitions, 7166 flow [2024-06-28 01:41:54,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 396 transitions, 6926 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-28 01:41:54,287 INFO L231 Difference]: Finished difference. Result has 192 places, 356 transitions, 6294 flow [2024-06-28 01:41:54,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5608, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6294, PETRI_PLACES=192, PETRI_TRANSITIONS=356} [2024-06-28 01:41:54,287 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 153 predicate places. [2024-06-28 01:41:54,287 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 356 transitions, 6294 flow [2024-06-28 01:41:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:54,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:54,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:41:54,288 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:54,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1179161270, now seen corresponding path program 9 times [2024-06-28 01:41:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453519574] [2024-06-28 01:41:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:54,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-28 01:41:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453519574] [2024-06-28 01:41:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453519574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067263952] [2024-06-28 01:41:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:54,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:54,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:54,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 356 transitions, 6294 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:54,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:54,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:54,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:55,619 INFO L124 PetriNetUnfolderBase]: 1973/4104 cut-off events. [2024-06-28 01:41:55,619 INFO L125 PetriNetUnfolderBase]: For 52032/52032 co-relation queries the response was YES. [2024-06-28 01:41:55,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25345 conditions, 4104 events. 1973/4104 cut-off events. For 52032/52032 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 32559 event pairs, 489 based on Foata normal form. 2/3907 useless extension candidates. Maximal degree in co-relation 25256. Up to 2886 conditions per place. [2024-06-28 01:41:55,660 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 316 selfloop transitions, 66 changer transitions 0/389 dead transitions. [2024-06-28 01:41:55,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 389 transitions, 7273 flow [2024-06-28 01:41:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 01:41:55,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:41:55,661 INFO L175 Difference]: Start difference. First operand has 192 places, 356 transitions, 6294 flow. Second operand 8 states and 140 transitions. [2024-06-28 01:41:55,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 389 transitions, 7273 flow [2024-06-28 01:41:55,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 389 transitions, 7124 flow, removed 68 selfloop flow, removed 2 redundant places. [2024-06-28 01:41:55,821 INFO L231 Difference]: Finished difference. Result has 198 places, 356 transitions, 6293 flow [2024-06-28 01:41:55,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6145, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6293, PETRI_PLACES=198, PETRI_TRANSITIONS=356} [2024-06-28 01:41:55,822 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 159 predicate places. [2024-06-28 01:41:55,822 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 356 transitions, 6293 flow [2024-06-28 01:41:55,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:55,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:55,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:55,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:41:55,822 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:55,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1294452564, now seen corresponding path program 10 times [2024-06-28 01:41:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985414182] [2024-06-28 01:41:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985414182] [2024-06-28 01:41:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985414182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:56,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:56,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:56,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070988880] [2024-06-28 01:41:56,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:56,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:56,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:56,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:56,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:56,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 356 transitions, 6293 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:56,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:56,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:56,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:57,315 INFO L124 PetriNetUnfolderBase]: 2029/4061 cut-off events. [2024-06-28 01:41:57,315 INFO L125 PetriNetUnfolderBase]: For 50752/50752 co-relation queries the response was YES. [2024-06-28 01:41:57,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25908 conditions, 4061 events. 2029/4061 cut-off events. For 50752/50752 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 31178 event pairs, 354 based on Foata normal form. 2/3897 useless extension candidates. Maximal degree in co-relation 25817. Up to 2196 conditions per place. [2024-06-28 01:41:57,355 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 220 selfloop transitions, 191 changer transitions 0/418 dead transitions. [2024-06-28 01:41:57,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 418 transitions, 7760 flow [2024-06-28 01:41:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-28 01:41:57,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5607142857142857 [2024-06-28 01:41:57,356 INFO L175 Difference]: Start difference. First operand has 198 places, 356 transitions, 6293 flow. Second operand 8 states and 157 transitions. [2024-06-28 01:41:57,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 418 transitions, 7760 flow [2024-06-28 01:41:57,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 418 transitions, 7592 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:41:57,589 INFO L231 Difference]: Finished difference. Result has 201 places, 368 transitions, 6822 flow [2024-06-28 01:41:57,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6127, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6822, PETRI_PLACES=201, PETRI_TRANSITIONS=368} [2024-06-28 01:41:57,590 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 162 predicate places. [2024-06-28 01:41:57,590 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 368 transitions, 6822 flow [2024-06-28 01:41:57,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:57,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:57,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:41:57,590 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:57,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1294457214, now seen corresponding path program 11 times [2024-06-28 01:41:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415942518] [2024-06-28 01:41:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:41:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:41:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:41:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415942518] [2024-06-28 01:41:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415942518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:41:58,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:41:58,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:41:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275510403] [2024-06-28 01:41:58,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:41:58,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:41:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:41:58,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:41:58,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:41:58,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:41:58,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 368 transitions, 6822 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:58,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:41:58,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:41:58,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:41:59,153 INFO L124 PetriNetUnfolderBase]: 2115/4373 cut-off events. [2024-06-28 01:41:59,154 INFO L125 PetriNetUnfolderBase]: For 57384/57384 co-relation queries the response was YES. [2024-06-28 01:41:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28055 conditions, 4373 events. 2115/4373 cut-off events. For 57384/57384 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 35131 event pairs, 505 based on Foata normal form. 2/4161 useless extension candidates. Maximal degree in co-relation 27962. Up to 2798 conditions per place. [2024-06-28 01:41:59,197 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 309 selfloop transitions, 111 changer transitions 0/427 dead transitions. [2024-06-28 01:41:59,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 427 transitions, 8376 flow [2024-06-28 01:41:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:41:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:41:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:41:59,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:41:59,199 INFO L175 Difference]: Start difference. First operand has 201 places, 368 transitions, 6822 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:41:59,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 427 transitions, 8376 flow [2024-06-28 01:41:59,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 427 transitions, 7806 flow, removed 58 selfloop flow, removed 7 redundant places. [2024-06-28 01:41:59,363 INFO L231 Difference]: Finished difference. Result has 202 places, 386 transitions, 6920 flow [2024-06-28 01:41:59,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6292, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6920, PETRI_PLACES=202, PETRI_TRANSITIONS=386} [2024-06-28 01:41:59,364 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 163 predicate places. [2024-06-28 01:41:59,364 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 386 transitions, 6920 flow [2024-06-28 01:41:59,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:41:59,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:41:59,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:41:59,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:41:59,365 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:41:59,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:41:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1294637138, now seen corresponding path program 2 times [2024-06-28 01:41:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:41:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483662919] [2024-06-28 01:41:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:41:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:41:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483662919] [2024-06-28 01:42:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483662919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:00,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244973397] [2024-06-28 01:42:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:00,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:00,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:00,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:00,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 386 transitions, 6920 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:00,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:00,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:00,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:01,331 INFO L124 PetriNetUnfolderBase]: 2147/4449 cut-off events. [2024-06-28 01:42:01,332 INFO L125 PetriNetUnfolderBase]: For 61729/61729 co-relation queries the response was YES. [2024-06-28 01:42:01,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27298 conditions, 4449 events. 2147/4449 cut-off events. For 61729/61729 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 35838 event pairs, 501 based on Foata normal form. 4/4236 useless extension candidates. Maximal degree in co-relation 27207. Up to 2852 conditions per place. [2024-06-28 01:42:01,373 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 321 selfloop transitions, 94 changer transitions 0/422 dead transitions. [2024-06-28 01:42:01,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 422 transitions, 8011 flow [2024-06-28 01:42:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:42:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:42:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:42:01,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:42:01,375 INFO L175 Difference]: Start difference. First operand has 202 places, 386 transitions, 6920 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:42:01,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 422 transitions, 8011 flow [2024-06-28 01:42:01,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 422 transitions, 7725 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-06-28 01:42:01,515 INFO L231 Difference]: Finished difference. Result has 205 places, 388 transitions, 6862 flow [2024-06-28 01:42:01,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6634, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6862, PETRI_PLACES=205, PETRI_TRANSITIONS=388} [2024-06-28 01:42:01,516 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 166 predicate places. [2024-06-28 01:42:01,516 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 388 transitions, 6862 flow [2024-06-28 01:42:01,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:01,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:01,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:01,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:42:01,517 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:01,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1294630194, now seen corresponding path program 12 times [2024-06-28 01:42:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158080115] [2024-06-28 01:42:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158080115] [2024-06-28 01:42:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158080115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:42:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967696637] [2024-06-28 01:42:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:02,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:42:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:42:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:42:02,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:02,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 388 transitions, 6862 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:02,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:02,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:02,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:03,348 INFO L124 PetriNetUnfolderBase]: 2211/4571 cut-off events. [2024-06-28 01:42:03,348 INFO L125 PetriNetUnfolderBase]: For 59882/59882 co-relation queries the response was YES. [2024-06-28 01:42:03,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27971 conditions, 4571 events. 2211/4571 cut-off events. For 59882/59882 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36959 event pairs, 468 based on Foata normal form. 2/4352 useless extension candidates. Maximal degree in co-relation 27879. Up to 2944 conditions per place. [2024-06-28 01:42:03,390 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 316 selfloop transitions, 112 changer transitions 0/435 dead transitions. [2024-06-28 01:42:03,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 435 transitions, 8188 flow [2024-06-28 01:42:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:42:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:42:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 01:42:03,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-28 01:42:03,392 INFO L175 Difference]: Start difference. First operand has 205 places, 388 transitions, 6862 flow. Second operand 8 states and 142 transitions. [2024-06-28 01:42:03,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 435 transitions, 8188 flow [2024-06-28 01:42:03,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 435 transitions, 7994 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 01:42:03,547 INFO L231 Difference]: Finished difference. Result has 207 places, 402 transitions, 7222 flow [2024-06-28 01:42:03,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6668, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7222, PETRI_PLACES=207, PETRI_TRANSITIONS=402} [2024-06-28 01:42:03,547 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 168 predicate places. [2024-06-28 01:42:03,547 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 402 transitions, 7222 flow [2024-06-28 01:42:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:03,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:03,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:03,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:42:03,548 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:03,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1575297748, now seen corresponding path program 3 times [2024-06-28 01:42:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420299497] [2024-06-28 01:42:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:04,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:04,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420299497] [2024-06-28 01:42:04,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420299497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:04,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:04,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:04,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158062937] [2024-06-28 01:42:04,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:04,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:04,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:04,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:04,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:04,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 402 transitions, 7222 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:04,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:04,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:04,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:05,464 INFO L124 PetriNetUnfolderBase]: 2227/4584 cut-off events. [2024-06-28 01:42:05,464 INFO L125 PetriNetUnfolderBase]: For 61166/61166 co-relation queries the response was YES. [2024-06-28 01:42:05,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28216 conditions, 4584 events. 2227/4584 cut-off events. For 61166/61166 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36989 event pairs, 761 based on Foata normal form. 2/4368 useless extension candidates. Maximal degree in co-relation 28123. Up to 3566 conditions per place. [2024-06-28 01:42:05,604 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 401 selfloop transitions, 18 changer transitions 0/426 dead transitions. [2024-06-28 01:42:05,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 426 transitions, 8200 flow [2024-06-28 01:42:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-28 01:42:05,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 01:42:05,605 INFO L175 Difference]: Start difference. First operand has 207 places, 402 transitions, 7222 flow. Second operand 9 states and 140 transitions. [2024-06-28 01:42:05,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 426 transitions, 8200 flow [2024-06-28 01:42:05,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 426 transitions, 7959 flow, removed 75 selfloop flow, removed 3 redundant places. [2024-06-28 01:42:05,767 INFO L231 Difference]: Finished difference. Result has 214 places, 405 transitions, 7062 flow [2024-06-28 01:42:05,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6981, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7062, PETRI_PLACES=214, PETRI_TRANSITIONS=405} [2024-06-28 01:42:05,768 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 175 predicate places. [2024-06-28 01:42:05,768 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 405 transitions, 7062 flow [2024-06-28 01:42:05,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:05,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:05,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:05,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:42:05,769 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:05,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1433517202, now seen corresponding path program 4 times [2024-06-28 01:42:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:05,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493797633] [2024-06-28 01:42:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:06,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:06,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493797633] [2024-06-28 01:42:06,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493797633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:06,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:06,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236222404] [2024-06-28 01:42:06,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:06,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:06,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:06,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 405 transitions, 7062 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:06,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:06,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:06,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:07,502 INFO L124 PetriNetUnfolderBase]: 2243/4612 cut-off events. [2024-06-28 01:42:07,502 INFO L125 PetriNetUnfolderBase]: For 60913/60913 co-relation queries the response was YES. [2024-06-28 01:42:07,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27952 conditions, 4612 events. 2243/4612 cut-off events. For 60913/60913 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 37229 event pairs, 767 based on Foata normal form. 2/4396 useless extension candidates. Maximal degree in co-relation 27857. Up to 3558 conditions per place. [2024-06-28 01:42:07,540 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 402 selfloop transitions, 24 changer transitions 0/433 dead transitions. [2024-06-28 01:42:07,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 433 transitions, 8120 flow [2024-06-28 01:42:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:42:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:42:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 01:42:07,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 01:42:07,541 INFO L175 Difference]: Start difference. First operand has 214 places, 405 transitions, 7062 flow. Second operand 8 states and 132 transitions. [2024-06-28 01:42:07,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 433 transitions, 8120 flow [2024-06-28 01:42:07,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 433 transitions, 8074 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:42:07,704 INFO L231 Difference]: Finished difference. Result has 217 places, 406 transitions, 7087 flow [2024-06-28 01:42:07,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7016, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7087, PETRI_PLACES=217, PETRI_TRANSITIONS=406} [2024-06-28 01:42:07,705 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 178 predicate places. [2024-06-28 01:42:07,705 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 406 transitions, 7087 flow [2024-06-28 01:42:07,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:07,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:07,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:07,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:42:07,706 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:07,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1993075576, now seen corresponding path program 5 times [2024-06-28 01:42:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:07,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033817840] [2024-06-28 01:42:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033817840] [2024-06-28 01:42:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033817840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:08,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580743108] [2024-06-28 01:42:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:08,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:08,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:08,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:08,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:08,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 406 transitions, 7087 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:08,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:08,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:08,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:09,446 INFO L124 PetriNetUnfolderBase]: 2250/4652 cut-off events. [2024-06-28 01:42:09,446 INFO L125 PetriNetUnfolderBase]: For 61892/61892 co-relation queries the response was YES. [2024-06-28 01:42:09,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28036 conditions, 4652 events. 2250/4652 cut-off events. For 61892/61892 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 37795 event pairs, 736 based on Foata normal form. 2/4428 useless extension candidates. Maximal degree in co-relation 27939. Up to 3546 conditions per place. [2024-06-28 01:42:09,494 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 404 selfloop transitions, 28 changer transitions 0/439 dead transitions. [2024-06-28 01:42:09,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 439 transitions, 8178 flow [2024-06-28 01:42:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:42:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:42:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 01:42:09,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-28 01:42:09,495 INFO L175 Difference]: Start difference. First operand has 217 places, 406 transitions, 7087 flow. Second operand 8 states and 135 transitions. [2024-06-28 01:42:09,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 439 transitions, 8178 flow [2024-06-28 01:42:09,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 439 transitions, 8075 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:42:09,663 INFO L231 Difference]: Finished difference. Result has 220 places, 409 transitions, 7117 flow [2024-06-28 01:42:09,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6984, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7117, PETRI_PLACES=220, PETRI_TRANSITIONS=409} [2024-06-28 01:42:09,664 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 181 predicate places. [2024-06-28 01:42:09,664 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 409 transitions, 7117 flow [2024-06-28 01:42:09,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:09,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:09,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:09,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:42:09,665 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:09,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 148867112, now seen corresponding path program 13 times [2024-06-28 01:42:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:09,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307598119] [2024-06-28 01:42:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307598119] [2024-06-28 01:42:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307598119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:10,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:42:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271595770] [2024-06-28 01:42:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:10,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:42:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:10,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:42:10,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:42:10,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:10,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 409 transitions, 7117 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:10,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:10,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:10,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:11,444 INFO L124 PetriNetUnfolderBase]: 2270/4644 cut-off events. [2024-06-28 01:42:11,444 INFO L125 PetriNetUnfolderBase]: For 57350/57350 co-relation queries the response was YES. [2024-06-28 01:42:11,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28200 conditions, 4644 events. 2270/4644 cut-off events. For 57350/57350 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 37287 event pairs, 457 based on Foata normal form. 2/4426 useless extension candidates. Maximal degree in co-relation 28101. Up to 3162 conditions per place. [2024-06-28 01:42:11,488 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 328 selfloop transitions, 126 changer transitions 0/461 dead transitions. [2024-06-28 01:42:11,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 461 transitions, 8496 flow [2024-06-28 01:42:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:42:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:42:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-28 01:42:11,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-28 01:42:11,490 INFO L175 Difference]: Start difference. First operand has 220 places, 409 transitions, 7117 flow. Second operand 8 states and 156 transitions. [2024-06-28 01:42:11,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 461 transitions, 8496 flow [2024-06-28 01:42:11,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 461 transitions, 8345 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-28 01:42:11,676 INFO L231 Difference]: Finished difference. Result has 226 places, 417 transitions, 7547 flow [2024-06-28 01:42:11,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6994, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7547, PETRI_PLACES=226, PETRI_TRANSITIONS=417} [2024-06-28 01:42:11,676 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 187 predicate places. [2024-06-28 01:42:11,676 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 417 transitions, 7547 flow [2024-06-28 01:42:11,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:11,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:11,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:11,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:42:11,677 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:11,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1810544090, now seen corresponding path program 1 times [2024-06-28 01:42:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:11,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487560834] [2024-06-28 01:42:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487560834] [2024-06-28 01:42:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487560834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:42:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101747159] [2024-06-28 01:42:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:11,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:42:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:42:11,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:42:11,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 01:42:11,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 417 transitions, 7547 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:11,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:11,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 01:42:11,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:12,209 INFO L124 PetriNetUnfolderBase]: 1337/2694 cut-off events. [2024-06-28 01:42:12,209 INFO L125 PetriNetUnfolderBase]: For 36512/36785 co-relation queries the response was YES. [2024-06-28 01:42:12,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16988 conditions, 2694 events. 1337/2694 cut-off events. For 36512/36785 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18687 event pairs, 232 based on Foata normal form. 343/2841 useless extension candidates. Maximal degree in co-relation 16886. Up to 818 conditions per place. [2024-06-28 01:42:12,235 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 142 selfloop transitions, 117 changer transitions 0/315 dead transitions. [2024-06-28 01:42:12,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 315 transitions, 5882 flow [2024-06-28 01:42:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:42:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:42:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-28 01:42:12,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-06-28 01:42:12,236 INFO L175 Difference]: Start difference. First operand has 226 places, 417 transitions, 7547 flow. Second operand 4 states and 95 transitions. [2024-06-28 01:42:12,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 315 transitions, 5882 flow [2024-06-28 01:42:12,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 315 transitions, 4816 flow, removed 43 selfloop flow, removed 37 redundant places. [2024-06-28 01:42:12,329 INFO L231 Difference]: Finished difference. Result has 194 places, 275 transitions, 4324 flow [2024-06-28 01:42:12,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3850, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4324, PETRI_PLACES=194, PETRI_TRANSITIONS=275} [2024-06-28 01:42:12,330 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 155 predicate places. [2024-06-28 01:42:12,330 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 275 transitions, 4324 flow [2024-06-28 01:42:12,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:12,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:12,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:42:12,331 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:12,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1299403151, now seen corresponding path program 1 times [2024-06-28 01:42:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:12,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455333744] [2024-06-28 01:42:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:13,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455333744] [2024-06-28 01:42:13,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455333744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:13,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:13,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:13,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62503003] [2024-06-28 01:42:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:13,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:13,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:13,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:13,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:13,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 275 transitions, 4324 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:13,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:13,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:13,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:13,938 INFO L124 PetriNetUnfolderBase]: 1487/3054 cut-off events. [2024-06-28 01:42:13,938 INFO L125 PetriNetUnfolderBase]: For 34165/34170 co-relation queries the response was YES. [2024-06-28 01:42:13,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17367 conditions, 3054 events. 1487/3054 cut-off events. For 34165/34170 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21743 event pairs, 373 based on Foata normal form. 13/2819 useless extension candidates. Maximal degree in co-relation 17279. Up to 1382 conditions per place. [2024-06-28 01:42:13,962 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 192 selfloop transitions, 119 changer transitions 0/319 dead transitions. [2024-06-28 01:42:13,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 319 transitions, 5236 flow [2024-06-28 01:42:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:42:13,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171428571428571 [2024-06-28 01:42:13,963 INFO L175 Difference]: Start difference. First operand has 194 places, 275 transitions, 4324 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:42:13,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 319 transitions, 5236 flow [2024-06-28 01:42:14,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 319 transitions, 5098 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 01:42:14,100 INFO L231 Difference]: Finished difference. Result has 200 places, 275 transitions, 4435 flow [2024-06-28 01:42:14,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4192, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4435, PETRI_PLACES=200, PETRI_TRANSITIONS=275} [2024-06-28 01:42:14,101 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 161 predicate places. [2024-06-28 01:42:14,101 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 275 transitions, 4435 flow [2024-06-28 01:42:14,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:14,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:14,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:42:14,102 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:14,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash 703944163, now seen corresponding path program 2 times [2024-06-28 01:42:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963437324] [2024-06-28 01:42:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963437324] [2024-06-28 01:42:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963437324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341952493] [2024-06-28 01:42:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:14,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:14,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:14,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 275 transitions, 4435 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:14,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:14,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:14,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:15,652 INFO L124 PetriNetUnfolderBase]: 1558/3284 cut-off events. [2024-06-28 01:42:15,652 INFO L125 PetriNetUnfolderBase]: For 35810/35815 co-relation queries the response was YES. [2024-06-28 01:42:15,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18350 conditions, 3284 events. 1558/3284 cut-off events. For 35810/35815 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24257 event pairs, 507 based on Foata normal form. 15/3029 useless extension candidates. Maximal degree in co-relation 18262. Up to 2119 conditions per place. [2024-06-28 01:42:15,674 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 178 selfloop transitions, 120 changer transitions 0/306 dead transitions. [2024-06-28 01:42:15,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 306 transitions, 5187 flow [2024-06-28 01:42:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-28 01:42:15,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 01:42:15,675 INFO L175 Difference]: Start difference. First operand has 200 places, 275 transitions, 4435 flow. Second operand 10 states and 170 transitions. [2024-06-28 01:42:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 306 transitions, 5187 flow [2024-06-28 01:42:15,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 306 transitions, 4928 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-28 01:42:15,772 INFO L231 Difference]: Finished difference. Result has 201 places, 275 transitions, 4430 flow [2024-06-28 01:42:15,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4182, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4430, PETRI_PLACES=201, PETRI_TRANSITIONS=275} [2024-06-28 01:42:15,773 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 162 predicate places. [2024-06-28 01:42:15,773 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 275 transitions, 4430 flow [2024-06-28 01:42:15,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:15,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:15,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:15,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:42:15,774 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:15,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash 703940443, now seen corresponding path program 3 times [2024-06-28 01:42:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:15,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179068825] [2024-06-28 01:42:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:15,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179068825] [2024-06-28 01:42:16,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179068825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:16,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:16,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794076961] [2024-06-28 01:42:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:16,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:16,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:16,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 275 transitions, 4430 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:16,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:16,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:16,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:17,150 INFO L124 PetriNetUnfolderBase]: 1528/3225 cut-off events. [2024-06-28 01:42:17,151 INFO L125 PetriNetUnfolderBase]: For 30418/30423 co-relation queries the response was YES. [2024-06-28 01:42:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17733 conditions, 3225 events. 1528/3225 cut-off events. For 30418/30423 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 23720 event pairs, 421 based on Foata normal form. 13/2968 useless extension candidates. Maximal degree in co-relation 17645. Up to 1898 conditions per place. [2024-06-28 01:42:17,177 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 186 selfloop transitions, 120 changer transitions 0/314 dead transitions. [2024-06-28 01:42:17,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 314 transitions, 5240 flow [2024-06-28 01:42:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-28 01:42:17,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057142857142857 [2024-06-28 01:42:17,178 INFO L175 Difference]: Start difference. First operand has 201 places, 275 transitions, 4430 flow. Second operand 10 states and 177 transitions. [2024-06-28 01:42:17,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 314 transitions, 5240 flow [2024-06-28 01:42:17,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 314 transitions, 5006 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:17,275 INFO L231 Difference]: Finished difference. Result has 203 places, 275 transitions, 4440 flow [2024-06-28 01:42:17,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4196, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4440, PETRI_PLACES=203, PETRI_TRANSITIONS=275} [2024-06-28 01:42:17,276 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 164 predicate places. [2024-06-28 01:42:17,276 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 275 transitions, 4440 flow [2024-06-28 01:42:17,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:17,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:17,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:17,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:42:17,277 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:17,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1784020281, now seen corresponding path program 4 times [2024-06-28 01:42:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550350780] [2024-06-28 01:42:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550350780] [2024-06-28 01:42:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550350780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:18,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59578953] [2024-06-28 01:42:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:18,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:18,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:18,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 275 transitions, 4440 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:18,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:18,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:18,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:18,895 INFO L124 PetriNetUnfolderBase]: 1599/3416 cut-off events. [2024-06-28 01:42:18,895 INFO L125 PetriNetUnfolderBase]: For 33015/33023 co-relation queries the response was YES. [2024-06-28 01:42:18,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18359 conditions, 3416 events. 1599/3416 cut-off events. For 33015/33023 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 25752 event pairs, 512 based on Foata normal form. 18/3164 useless extension candidates. Maximal degree in co-relation 18270. Up to 2335 conditions per place. [2024-06-28 01:42:18,923 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 244 selfloop transitions, 53 changer transitions 0/305 dead transitions. [2024-06-28 01:42:18,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 305 transitions, 5184 flow [2024-06-28 01:42:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-28 01:42:18,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2024-06-28 01:42:18,925 INFO L175 Difference]: Start difference. First operand has 203 places, 275 transitions, 4440 flow. Second operand 10 states and 169 transitions. [2024-06-28 01:42:18,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 305 transitions, 5184 flow [2024-06-28 01:42:19,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 305 transitions, 4946 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:19,048 INFO L231 Difference]: Finished difference. Result has 205 places, 275 transitions, 4316 flow [2024-06-28 01:42:19,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4202, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4316, PETRI_PLACES=205, PETRI_TRANSITIONS=275} [2024-06-28 01:42:19,049 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 166 predicate places. [2024-06-28 01:42:19,049 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 275 transitions, 4316 flow [2024-06-28 01:42:19,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:19,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:19,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:19,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:42:19,050 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:19,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash 786469731, now seen corresponding path program 5 times [2024-06-28 01:42:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559030659] [2024-06-28 01:42:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:19,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559030659] [2024-06-28 01:42:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559030659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940756687] [2024-06-28 01:42:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:19,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:19,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:19,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:19,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:19,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 275 transitions, 4316 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:19,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:19,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:19,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:20,836 INFO L124 PetriNetUnfolderBase]: 1774/3837 cut-off events. [2024-06-28 01:42:20,836 INFO L125 PetriNetUnfolderBase]: For 37971/37979 co-relation queries the response was YES. [2024-06-28 01:42:20,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19802 conditions, 3837 events. 1774/3837 cut-off events. For 37971/37979 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 29980 event pairs, 615 based on Foata normal form. 16/3565 useless extension candidates. Maximal degree in co-relation 19712. Up to 2331 conditions per place. [2024-06-28 01:42:20,863 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 227 selfloop transitions, 79 changer transitions 0/314 dead transitions. [2024-06-28 01:42:20,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 314 transitions, 5192 flow [2024-06-28 01:42:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-28 01:42:20,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057142857142857 [2024-06-28 01:42:20,865 INFO L175 Difference]: Start difference. First operand has 205 places, 275 transitions, 4316 flow. Second operand 10 states and 177 transitions. [2024-06-28 01:42:20,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 314 transitions, 5192 flow [2024-06-28 01:42:20,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 314 transitions, 5082 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:42:20,987 INFO L231 Difference]: Finished difference. Result has 206 places, 275 transitions, 4368 flow [2024-06-28 01:42:20,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4206, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4368, PETRI_PLACES=206, PETRI_TRANSITIONS=275} [2024-06-28 01:42:20,988 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 167 predicate places. [2024-06-28 01:42:20,988 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 275 transitions, 4368 flow [2024-06-28 01:42:20,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:20,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:20,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:42:20,988 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:20,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 786473451, now seen corresponding path program 6 times [2024-06-28 01:42:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877658048] [2024-06-28 01:42:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877658048] [2024-06-28 01:42:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877658048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571864469] [2024-06-28 01:42:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:21,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:21,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 275 transitions, 4368 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:21,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:21,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:21,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:22,596 INFO L124 PetriNetUnfolderBase]: 1761/3845 cut-off events. [2024-06-28 01:42:22,596 INFO L125 PetriNetUnfolderBase]: For 35197/35205 co-relation queries the response was YES. [2024-06-28 01:42:22,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19528 conditions, 3845 events. 1761/3845 cut-off events. For 35197/35205 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 30231 event pairs, 656 based on Foata normal form. 18/3566 useless extension candidates. Maximal degree in co-relation 19437. Up to 2655 conditions per place. [2024-06-28 01:42:22,629 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 220 selfloop transitions, 78 changer transitions 0/306 dead transitions. [2024-06-28 01:42:22,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 306 transitions, 5116 flow [2024-06-28 01:42:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 01:42:22,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48857142857142855 [2024-06-28 01:42:22,630 INFO L175 Difference]: Start difference. First operand has 206 places, 275 transitions, 4368 flow. Second operand 10 states and 171 transitions. [2024-06-28 01:42:22,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 306 transitions, 5116 flow [2024-06-28 01:42:22,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 306 transitions, 4960 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:22,747 INFO L231 Difference]: Finished difference. Result has 208 places, 275 transitions, 4374 flow [2024-06-28 01:42:22,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4212, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4374, PETRI_PLACES=208, PETRI_TRANSITIONS=275} [2024-06-28 01:42:22,747 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 169 predicate places. [2024-06-28 01:42:22,748 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 275 transitions, 4374 flow [2024-06-28 01:42:22,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:22,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:22,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:22,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:42:22,748 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:22,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1096839225, now seen corresponding path program 7 times [2024-06-28 01:42:22,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:22,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795313324] [2024-06-28 01:42:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:22,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:23,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-28 01:42:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795313324] [2024-06-28 01:42:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795313324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:23,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:23,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992654916] [2024-06-28 01:42:23,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:23,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:23,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:23,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:23,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:23,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:23,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 275 transitions, 4374 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:23,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:23,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:23,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:24,394 INFO L124 PetriNetUnfolderBase]: 2137/4643 cut-off events. [2024-06-28 01:42:24,395 INFO L125 PetriNetUnfolderBase]: For 39935/39940 co-relation queries the response was YES. [2024-06-28 01:42:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22457 conditions, 4643 events. 2137/4643 cut-off events. For 39935/39940 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 38277 event pairs, 478 based on Foata normal form. 13/4324 useless extension candidates. Maximal degree in co-relation 22365. Up to 1237 conditions per place. [2024-06-28 01:42:24,443 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 178 selfloop transitions, 156 changer transitions 0/342 dead transitions. [2024-06-28 01:42:24,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 342 transitions, 5618 flow [2024-06-28 01:42:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 01:42:24,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:42:24,445 INFO L175 Difference]: Start difference. First operand has 208 places, 275 transitions, 4374 flow. Second operand 10 states and 185 transitions. [2024-06-28 01:42:24,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 342 transitions, 5618 flow [2024-06-28 01:42:24,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 342 transitions, 5466 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:24,601 INFO L231 Difference]: Finished difference. Result has 211 places, 277 transitions, 4654 flow [2024-06-28 01:42:24,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4222, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4654, PETRI_PLACES=211, PETRI_TRANSITIONS=277} [2024-06-28 01:42:24,602 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 172 predicate places. [2024-06-28 01:42:24,603 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 277 transitions, 4654 flow [2024-06-28 01:42:24,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:24,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:24,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:24,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:42:24,603 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:24,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash 171047615, now seen corresponding path program 8 times [2024-06-28 01:42:24,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:24,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237208577] [2024-06-28 01:42:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:24,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:25,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:25,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237208577] [2024-06-28 01:42:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237208577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:25,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691930805] [2024-06-28 01:42:25,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:25,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:25,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:25,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 277 transitions, 4654 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:25,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:25,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:25,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:26,574 INFO L124 PetriNetUnfolderBase]: 2673/6195 cut-off events. [2024-06-28 01:42:26,574 INFO L125 PetriNetUnfolderBase]: For 56744/56749 co-relation queries the response was YES. [2024-06-28 01:42:26,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28649 conditions, 6195 events. 2673/6195 cut-off events. For 56744/56749 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 57189 event pairs, 1289 based on Foata normal form. 13/5775 useless extension candidates. Maximal degree in co-relation 28555. Up to 2944 conditions per place. [2024-06-28 01:42:26,631 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 169 selfloop transitions, 156 changer transitions 0/333 dead transitions. [2024-06-28 01:42:26,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 333 transitions, 5792 flow [2024-06-28 01:42:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 01:42:26,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-28 01:42:26,632 INFO L175 Difference]: Start difference. First operand has 211 places, 277 transitions, 4654 flow. Second operand 10 states and 182 transitions. [2024-06-28 01:42:26,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 333 transitions, 5792 flow [2024-06-28 01:42:26,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 333 transitions, 5529 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-28 01:42:26,826 INFO L231 Difference]: Finished difference. Result has 216 places, 279 transitions, 4827 flow [2024-06-28 01:42:26,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4426, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4827, PETRI_PLACES=216, PETRI_TRANSITIONS=279} [2024-06-28 01:42:26,827 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 177 predicate places. [2024-06-28 01:42:26,827 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 279 transitions, 4827 flow [2024-06-28 01:42:26,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:26,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:26,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:26,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:42:26,828 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:26,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1007742051, now seen corresponding path program 9 times [2024-06-28 01:42:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:26,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589805103] [2024-06-28 01:42:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589805103] [2024-06-28 01:42:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589805103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531737118] [2024-06-28 01:42:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:27,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:27,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:27,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:27,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 279 transitions, 4827 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:27,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:27,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:27,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:28,695 INFO L124 PetriNetUnfolderBase]: 2644/6021 cut-off events. [2024-06-28 01:42:28,695 INFO L125 PetriNetUnfolderBase]: For 56905/56910 co-relation queries the response was YES. [2024-06-28 01:42:28,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27954 conditions, 6021 events. 2644/6021 cut-off events. For 56905/56910 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 54440 event pairs, 1417 based on Foata normal form. 15/5630 useless extension candidates. Maximal degree in co-relation 27857. Up to 4081 conditions per place. [2024-06-28 01:42:28,744 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 180 selfloop transitions, 128 changer transitions 0/316 dead transitions. [2024-06-28 01:42:28,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 316 transitions, 5679 flow [2024-06-28 01:42:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-28 01:42:28,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2024-06-28 01:42:28,745 INFO L175 Difference]: Start difference. First operand has 216 places, 279 transitions, 4827 flow. Second operand 10 states and 169 transitions. [2024-06-28 01:42:28,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 316 transitions, 5679 flow [2024-06-28 01:42:28,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 316 transitions, 5406 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:42:28,955 INFO L231 Difference]: Finished difference. Result has 220 places, 280 transitions, 4893 flow [2024-06-28 01:42:28,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4556, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4893, PETRI_PLACES=220, PETRI_TRANSITIONS=280} [2024-06-28 01:42:28,955 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 181 predicate places. [2024-06-28 01:42:28,955 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 280 transitions, 4893 flow [2024-06-28 01:42:28,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:28,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:28,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:28,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:42:28,956 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:28,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1175744285, now seen corresponding path program 10 times [2024-06-28 01:42:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493876128] [2024-06-28 01:42:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:29,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493876128] [2024-06-28 01:42:29,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493876128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:29,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:29,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432882544] [2024-06-28 01:42:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:29,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:29,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:29,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 280 transitions, 4893 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:29,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:29,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:30,944 INFO L124 PetriNetUnfolderBase]: 2713/6303 cut-off events. [2024-06-28 01:42:30,944 INFO L125 PetriNetUnfolderBase]: For 52176/52181 co-relation queries the response was YES. [2024-06-28 01:42:30,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28667 conditions, 6303 events. 2713/6303 cut-off events. For 52176/52181 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 58315 event pairs, 1334 based on Foata normal form. 13/5879 useless extension candidates. Maximal degree in co-relation 28568. Up to 3862 conditions per place. [2024-06-28 01:42:30,998 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 162 selfloop transitions, 156 changer transitions 0/326 dead transitions. [2024-06-28 01:42:30,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 326 transitions, 5822 flow [2024-06-28 01:42:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:42:30,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2024-06-28 01:42:30,999 INFO L175 Difference]: Start difference. First operand has 220 places, 280 transitions, 4893 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:42:30,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 326 transitions, 5822 flow [2024-06-28 01:42:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 326 transitions, 5679 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 01:42:31,310 INFO L231 Difference]: Finished difference. Result has 226 places, 281 transitions, 5097 flow [2024-06-28 01:42:31,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4750, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5097, PETRI_PLACES=226, PETRI_TRANSITIONS=281} [2024-06-28 01:42:31,311 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 187 predicate places. [2024-06-28 01:42:31,311 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 281 transitions, 5097 flow [2024-06-28 01:42:31,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:31,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:31,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:31,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:42:31,312 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:31,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1006936099, now seen corresponding path program 11 times [2024-06-28 01:42:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146595401] [2024-06-28 01:42:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:32,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146595401] [2024-06-28 01:42:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146595401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:32,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471148062] [2024-06-28 01:42:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:32,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:32,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 281 transitions, 5097 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:32,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:32,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:32,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:33,486 INFO L124 PetriNetUnfolderBase]: 3026/7044 cut-off events. [2024-06-28 01:42:33,486 INFO L125 PetriNetUnfolderBase]: For 64995/64997 co-relation queries the response was YES. [2024-06-28 01:42:33,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31864 conditions, 7044 events. 3026/7044 cut-off events. For 64995/64997 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 66693 event pairs, 1652 based on Foata normal form. 10/6552 useless extension candidates. Maximal degree in co-relation 31763. Up to 4586 conditions per place. [2024-06-28 01:42:33,554 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 223 selfloop transitions, 98 changer transitions 0/329 dead transitions. [2024-06-28 01:42:33,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 329 transitions, 6109 flow [2024-06-28 01:42:33,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 01:42:33,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-28 01:42:33,555 INFO L175 Difference]: Start difference. First operand has 226 places, 281 transitions, 5097 flow. Second operand 10 states and 182 transitions. [2024-06-28 01:42:33,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 329 transitions, 6109 flow [2024-06-28 01:42:33,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 329 transitions, 5807 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:42:33,809 INFO L231 Difference]: Finished difference. Result has 230 places, 285 transitions, 5091 flow [2024-06-28 01:42:33,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4797, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5091, PETRI_PLACES=230, PETRI_TRANSITIONS=285} [2024-06-28 01:42:33,809 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 191 predicate places. [2024-06-28 01:42:33,810 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 285 transitions, 5091 flow [2024-06-28 01:42:33,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:33,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:33,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:33,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:42:33,810 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:33,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:33,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1006932379, now seen corresponding path program 12 times [2024-06-28 01:42:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233828200] [2024-06-28 01:42:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:33,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233828200] [2024-06-28 01:42:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233828200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:34,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202516213] [2024-06-28 01:42:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:34,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:34,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:34,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 285 transitions, 5091 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:34,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:34,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:34,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:35,938 INFO L124 PetriNetUnfolderBase]: 3168/7483 cut-off events. [2024-06-28 01:42:35,939 INFO L125 PetriNetUnfolderBase]: For 69159/69161 co-relation queries the response was YES. [2024-06-28 01:42:35,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32985 conditions, 7483 events. 3168/7483 cut-off events. For 69159/69161 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 72226 event pairs, 1846 based on Foata normal form. 12/6955 useless extension candidates. Maximal degree in co-relation 32882. Up to 5283 conditions per place. [2024-06-28 01:42:36,016 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 217 selfloop transitions, 94 changer transitions 0/319 dead transitions. [2024-06-28 01:42:36,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 319 transitions, 5889 flow [2024-06-28 01:42:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 01:42:36,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 01:42:36,017 INFO L175 Difference]: Start difference. First operand has 230 places, 285 transitions, 5091 flow. Second operand 10 states and 174 transitions. [2024-06-28 01:42:36,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 319 transitions, 5889 flow [2024-06-28 01:42:36,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 319 transitions, 5718 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:42:36,334 INFO L231 Difference]: Finished difference. Result has 233 places, 285 transitions, 5114 flow [2024-06-28 01:42:36,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4920, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5114, PETRI_PLACES=233, PETRI_TRANSITIONS=285} [2024-06-28 01:42:36,334 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 194 predicate places. [2024-06-28 01:42:36,334 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 285 transitions, 5114 flow [2024-06-28 01:42:36,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:36,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:36,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:42:36,335 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:36,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1001218087, now seen corresponding path program 1 times [2024-06-28 01:42:36,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:36,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679571031] [2024-06-28 01:42:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679571031] [2024-06-28 01:42:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679571031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24650924] [2024-06-28 01:42:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:37,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:37,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:37,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:37,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:37,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 285 transitions, 5114 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:37,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:37,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:37,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:38,390 INFO L124 PetriNetUnfolderBase]: 3185/7531 cut-off events. [2024-06-28 01:42:38,390 INFO L125 PetriNetUnfolderBase]: For 64676/64681 co-relation queries the response was YES. [2024-06-28 01:42:38,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33245 conditions, 7531 events. 3185/7531 cut-off events. For 64676/64681 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 72840 event pairs, 1873 based on Foata normal form. 7/6999 useless extension candidates. Maximal degree in co-relation 33141. Up to 5701 conditions per place. [2024-06-28 01:42:38,465 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 251 selfloop transitions, 51 changer transitions 0/310 dead transitions. [2024-06-28 01:42:38,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 310 transitions, 5854 flow [2024-06-28 01:42:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:42:38,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:42:38,466 INFO L175 Difference]: Start difference. First operand has 233 places, 285 transitions, 5114 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:42:38,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 310 transitions, 5854 flow [2024-06-28 01:42:38,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 310 transitions, 5693 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:42:38,787 INFO L231 Difference]: Finished difference. Result has 235 places, 286 transitions, 5073 flow [2024-06-28 01:42:38,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4953, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5073, PETRI_PLACES=235, PETRI_TRANSITIONS=286} [2024-06-28 01:42:38,787 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 196 predicate places. [2024-06-28 01:42:38,787 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 286 transitions, 5073 flow [2024-06-28 01:42:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:38,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:38,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:38,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:42:38,788 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:38,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1001425849, now seen corresponding path program 13 times [2024-06-28 01:42:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031677673] [2024-06-28 01:42:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031677673] [2024-06-28 01:42:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031677673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064368245] [2024-06-28 01:42:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:39,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:39,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:39,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 286 transitions, 5073 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:39,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:39,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:39,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:41,194 INFO L124 PetriNetUnfolderBase]: 3327/7905 cut-off events. [2024-06-28 01:42:41,194 INFO L125 PetriNetUnfolderBase]: For 73314/73319 co-relation queries the response was YES. [2024-06-28 01:42:41,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34318 conditions, 7905 events. 3327/7905 cut-off events. For 73314/73319 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 77399 event pairs, 1966 based on Foata normal form. 15/7360 useless extension candidates. Maximal degree in co-relation 34213. Up to 5657 conditions per place. [2024-06-28 01:42:41,277 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 248 selfloop transitions, 64 changer transitions 0/320 dead transitions. [2024-06-28 01:42:41,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 320 transitions, 5886 flow [2024-06-28 01:42:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-28 01:42:41,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-28 01:42:41,278 INFO L175 Difference]: Start difference. First operand has 235 places, 286 transitions, 5073 flow. Second operand 10 states and 168 transitions. [2024-06-28 01:42:41,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 320 transitions, 5886 flow [2024-06-28 01:42:41,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 320 transitions, 5799 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:42:41,623 INFO L231 Difference]: Finished difference. Result has 239 places, 286 transitions, 5120 flow [2024-06-28 01:42:41,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4986, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5120, PETRI_PLACES=239, PETRI_TRANSITIONS=286} [2024-06-28 01:42:41,624 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 200 predicate places. [2024-06-28 01:42:41,624 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 286 transitions, 5120 flow [2024-06-28 01:42:41,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:41,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:41,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:41,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:42:41,625 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:41,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1001210647, now seen corresponding path program 2 times [2024-06-28 01:42:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780777778] [2024-06-28 01:42:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780777778] [2024-06-28 01:42:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780777778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:42,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979162541] [2024-06-28 01:42:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:42,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:42,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:42,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:42,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:42,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 286 transitions, 5120 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:42,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:42,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:42,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:43,808 INFO L124 PetriNetUnfolderBase]: 3397/8079 cut-off events. [2024-06-28 01:42:43,808 INFO L125 PetriNetUnfolderBase]: For 71266/71271 co-relation queries the response was YES. [2024-06-28 01:42:43,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35064 conditions, 8079 events. 3397/8079 cut-off events. For 71266/71271 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 79563 event pairs, 1952 based on Foata normal form. 7/7512 useless extension candidates. Maximal degree in co-relation 34958. Up to 5955 conditions per place. [2024-06-28 01:42:43,893 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 256 selfloop transitions, 55 changer transitions 0/319 dead transitions. [2024-06-28 01:42:43,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 319 transitions, 6016 flow [2024-06-28 01:42:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:42:43,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-28 01:42:43,895 INFO L175 Difference]: Start difference. First operand has 239 places, 286 transitions, 5120 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:42:43,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 319 transitions, 6016 flow [2024-06-28 01:42:44,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 319 transitions, 5892 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:44,260 INFO L231 Difference]: Finished difference. Result has 241 places, 291 transitions, 5179 flow [2024-06-28 01:42:44,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4996, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5179, PETRI_PLACES=241, PETRI_TRANSITIONS=291} [2024-06-28 01:42:44,261 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 202 predicate places. [2024-06-28 01:42:44,261 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 291 transitions, 5179 flow [2024-06-28 01:42:44,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:44,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:44,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:44,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:42:44,261 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:44,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1006782277, now seen corresponding path program 3 times [2024-06-28 01:42:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327704916] [2024-06-28 01:42:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:45,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327704916] [2024-06-28 01:42:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327704916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:45,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:45,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418084363] [2024-06-28 01:42:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:45,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:45,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:45,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:45,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 291 transitions, 5179 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:45,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:45,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:45,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:46,594 INFO L124 PetriNetUnfolderBase]: 3405/8098 cut-off events. [2024-06-28 01:42:46,594 INFO L125 PetriNetUnfolderBase]: For 71040/71042 co-relation queries the response was YES. [2024-06-28 01:42:46,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35334 conditions, 8098 events. 3405/8098 cut-off events. For 71040/71042 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 79830 event pairs, 2015 based on Foata normal form. 4/7511 useless extension candidates. Maximal degree in co-relation 35226. Up to 6129 conditions per place. [2024-06-28 01:42:46,677 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 255 selfloop transitions, 54 changer transitions 0/317 dead transitions. [2024-06-28 01:42:46,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 317 transitions, 5942 flow [2024-06-28 01:42:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 01:42:46,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-28 01:42:46,678 INFO L175 Difference]: Start difference. First operand has 241 places, 291 transitions, 5179 flow. Second operand 9 states and 152 transitions. [2024-06-28 01:42:46,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 317 transitions, 5942 flow [2024-06-28 01:42:47,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 317 transitions, 5857 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 01:42:47,049 INFO L231 Difference]: Finished difference. Result has 245 places, 292 transitions, 5225 flow [2024-06-28 01:42:47,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5100, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5225, PETRI_PLACES=245, PETRI_TRANSITIONS=292} [2024-06-28 01:42:47,049 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 206 predicate places. [2024-06-28 01:42:47,049 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 292 transitions, 5225 flow [2024-06-28 01:42:47,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:47,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:47,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:42:47,050 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:47,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1006788229, now seen corresponding path program 14 times [2024-06-28 01:42:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554038550] [2024-06-28 01:42:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:47,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:47,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554038550] [2024-06-28 01:42:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554038550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:47,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029851774] [2024-06-28 01:42:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:47,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:47,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:47,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:47,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:47,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 292 transitions, 5225 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:47,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:47,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:47,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:49,500 INFO L124 PetriNetUnfolderBase]: 3437/8213 cut-off events. [2024-06-28 01:42:49,500 INFO L125 PetriNetUnfolderBase]: For 70003/70005 co-relation queries the response was YES. [2024-06-28 01:42:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35243 conditions, 8213 events. 3437/8213 cut-off events. For 70003/70005 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 81318 event pairs, 2016 based on Foata normal form. 12/7628 useless extension candidates. Maximal degree in co-relation 35133. Up to 5908 conditions per place. [2024-06-28 01:42:49,587 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 260 selfloop transitions, 57 changer transitions 0/325 dead transitions. [2024-06-28 01:42:49,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 325 transitions, 6032 flow [2024-06-28 01:42:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:42:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:42:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-28 01:42:49,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2024-06-28 01:42:49,589 INFO L175 Difference]: Start difference. First operand has 245 places, 292 transitions, 5225 flow. Second operand 10 states and 169 transitions. [2024-06-28 01:42:49,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 325 transitions, 6032 flow [2024-06-28 01:42:49,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 325 transitions, 5941 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:42:49,911 INFO L231 Difference]: Finished difference. Result has 250 places, 292 transitions, 5254 flow [2024-06-28 01:42:49,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5134, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5254, PETRI_PLACES=250, PETRI_TRANSITIONS=292} [2024-06-28 01:42:49,912 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 211 predicate places. [2024-06-28 01:42:49,912 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 292 transitions, 5254 flow [2024-06-28 01:42:49,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:49,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:49,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:49,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:42:49,913 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:49,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2105696175, now seen corresponding path program 15 times [2024-06-28 01:42:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084868261] [2024-06-28 01:42:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:50,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:50,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084868261] [2024-06-28 01:42:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084868261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:50,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409948241] [2024-06-28 01:42:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:50,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:50,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:50,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 292 transitions, 5254 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:50,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:50,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:50,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:52,255 INFO L124 PetriNetUnfolderBase]: 3555/8297 cut-off events. [2024-06-28 01:42:52,256 INFO L125 PetriNetUnfolderBase]: For 70322/70327 co-relation queries the response was YES. [2024-06-28 01:42:52,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35945 conditions, 8297 events. 3555/8297 cut-off events. For 70322/70327 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 81111 event pairs, 1549 based on Foata normal form. 13/7774 useless extension candidates. Maximal degree in co-relation 35834. Up to 4315 conditions per place. [2024-06-28 01:42:52,345 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 160 selfloop transitions, 166 changer transitions 0/334 dead transitions. [2024-06-28 01:42:52,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 334 transitions, 6226 flow [2024-06-28 01:42:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:42:52,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-28 01:42:52,346 INFO L175 Difference]: Start difference. First operand has 250 places, 292 transitions, 5254 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:42:52,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 334 transitions, 6226 flow [2024-06-28 01:42:52,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 334 transitions, 6143 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:42:52,675 INFO L231 Difference]: Finished difference. Result has 251 places, 292 transitions, 5515 flow [2024-06-28 01:42:52,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5171, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5515, PETRI_PLACES=251, PETRI_TRANSITIONS=292} [2024-06-28 01:42:52,675 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 212 predicate places. [2024-06-28 01:42:52,675 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 292 transitions, 5515 flow [2024-06-28 01:42:52,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:52,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:52,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:52,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:42:52,676 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:52,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2107570125, now seen corresponding path program 16 times [2024-06-28 01:42:52,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646629859] [2024-06-28 01:42:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646629859] [2024-06-28 01:42:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646629859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:53,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:53,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090222980] [2024-06-28 01:42:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:53,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:53,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:53,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:53,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:53,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 292 transitions, 5515 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:53,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:53,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:53,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:55,026 INFO L124 PetriNetUnfolderBase]: 3818/9239 cut-off events. [2024-06-28 01:42:55,027 INFO L125 PetriNetUnfolderBase]: For 88121/88126 co-relation queries the response was YES. [2024-06-28 01:42:55,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39319 conditions, 9239 events. 3818/9239 cut-off events. For 88121/88126 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 94285 event pairs, 1988 based on Foata normal form. 13/8599 useless extension candidates. Maximal degree in co-relation 39207. Up to 4842 conditions per place. [2024-06-28 01:42:55,121 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 166 selfloop transitions, 160 changer transitions 0/334 dead transitions. [2024-06-28 01:42:55,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 334 transitions, 6497 flow [2024-06-28 01:42:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 01:42:55,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:42:55,123 INFO L175 Difference]: Start difference. First operand has 251 places, 292 transitions, 5515 flow. Second operand 9 states and 162 transitions. [2024-06-28 01:42:55,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 334 transitions, 6497 flow [2024-06-28 01:42:55,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 334 transitions, 6152 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-28 01:42:55,604 INFO L231 Difference]: Finished difference. Result has 250 places, 292 transitions, 5506 flow [2024-06-28 01:42:55,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5176, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5506, PETRI_PLACES=250, PETRI_TRANSITIONS=292} [2024-06-28 01:42:55,605 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 211 predicate places. [2024-06-28 01:42:55,605 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 292 transitions, 5506 flow [2024-06-28 01:42:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:55,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:55,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:55,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:42:55,606 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:55,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2107573845, now seen corresponding path program 17 times [2024-06-28 01:42:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059518380] [2024-06-28 01:42:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:56,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059518380] [2024-06-28 01:42:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059518380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178091143] [2024-06-28 01:42:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:56,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:56,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 292 transitions, 5506 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:56,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:56,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:56,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:42:58,150 INFO L124 PetriNetUnfolderBase]: 3761/9028 cut-off events. [2024-06-28 01:42:58,150 INFO L125 PetriNetUnfolderBase]: For 76601/76606 co-relation queries the response was YES. [2024-06-28 01:42:58,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38327 conditions, 9028 events. 3761/9028 cut-off events. For 76601/76606 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 91408 event pairs, 2110 based on Foata normal form. 15/8419 useless extension candidates. Maximal degree in co-relation 38217. Up to 5638 conditions per place. [2024-06-28 01:42:58,251 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 160 selfloop transitions, 157 changer transitions 0/325 dead transitions. [2024-06-28 01:42:58,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 325 transitions, 6337 flow [2024-06-28 01:42:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:42:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:42:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:42:58,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-28 01:42:58,253 INFO L175 Difference]: Start difference. First operand has 250 places, 292 transitions, 5506 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:42:58,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 325 transitions, 6337 flow [2024-06-28 01:42:58,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 325 transitions, 6015 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 01:42:58,648 INFO L231 Difference]: Finished difference. Result has 250 places, 292 transitions, 5512 flow [2024-06-28 01:42:58,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5184, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5512, PETRI_PLACES=250, PETRI_TRANSITIONS=292} [2024-06-28 01:42:58,649 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 211 predicate places. [2024-06-28 01:42:58,649 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 292 transitions, 5512 flow [2024-06-28 01:42:58,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:58,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:42:58,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:42:58,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:42:58,649 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:42:58,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:42:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1512151821, now seen corresponding path program 18 times [2024-06-28 01:42:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:42:58,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602702344] [2024-06-28 01:42:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:42:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:42:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:42:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:42:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:42:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602702344] [2024-06-28 01:42:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602702344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:42:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:42:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:42:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871847289] [2024-06-28 01:42:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:42:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:42:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:42:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:42:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:42:59,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:42:59,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 292 transitions, 5512 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:42:59,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:42:59,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:42:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:01,138 INFO L124 PetriNetUnfolderBase]: 3925/9470 cut-off events. [2024-06-28 01:43:01,138 INFO L125 PetriNetUnfolderBase]: For 76361/76369 co-relation queries the response was YES. [2024-06-28 01:43:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39600 conditions, 9470 events. 3925/9470 cut-off events. For 76361/76369 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 97282 event pairs, 2443 based on Foata normal form. 18/8823 useless extension candidates. Maximal degree in co-relation 39491. Up to 6559 conditions per place. [2024-06-28 01:43:01,234 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 250 selfloop transitions, 64 changer transitions 0/322 dead transitions. [2024-06-28 01:43:01,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 322 transitions, 6339 flow [2024-06-28 01:43:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-28 01:43:01,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-28 01:43:01,236 INFO L175 Difference]: Start difference. First operand has 250 places, 292 transitions, 5512 flow. Second operand 9 states and 149 transitions. [2024-06-28 01:43:01,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 322 transitions, 6339 flow [2024-06-28 01:43:01,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 322 transitions, 6023 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 01:43:01,605 INFO L231 Difference]: Finished difference. Result has 250 places, 292 transitions, 5336 flow [2024-06-28 01:43:01,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5196, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5336, PETRI_PLACES=250, PETRI_TRANSITIONS=292} [2024-06-28 01:43:01,605 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 211 predicate places. [2024-06-28 01:43:01,605 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 292 transitions, 5336 flow [2024-06-28 01:43:01,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:01,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:01,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:01,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:43:01,606 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:01,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2100701641, now seen corresponding path program 19 times [2024-06-28 01:43:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470790080] [2024-06-28 01:43:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:01,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470790080] [2024-06-28 01:43:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470790080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:02,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811451718] [2024-06-28 01:43:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:02,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:02,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:02,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:02,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 292 transitions, 5336 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:02,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:02,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:02,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:04,260 INFO L124 PetriNetUnfolderBase]: 4067/9811 cut-off events. [2024-06-28 01:43:04,261 INFO L125 PetriNetUnfolderBase]: For 73559/73567 co-relation queries the response was YES. [2024-06-28 01:43:04,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40355 conditions, 9811 events. 4067/9811 cut-off events. For 73559/73567 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 101446 event pairs, 2483 based on Foata normal form. 18/9154 useless extension candidates. Maximal degree in co-relation 40247. Up to 6755 conditions per place. [2024-06-28 01:43:04,353 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 218 selfloop transitions, 98 changer transitions 0/324 dead transitions. [2024-06-28 01:43:04,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 324 transitions, 6183 flow [2024-06-28 01:43:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 01:43:04,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 01:43:04,355 INFO L175 Difference]: Start difference. First operand has 250 places, 292 transitions, 5336 flow. Second operand 9 states and 153 transitions. [2024-06-28 01:43:04,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 324 transitions, 6183 flow [2024-06-28 01:43:04,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 324 transitions, 6080 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:04,705 INFO L231 Difference]: Finished difference. Result has 253 places, 292 transitions, 5441 flow [2024-06-28 01:43:04,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5233, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5441, PETRI_PLACES=253, PETRI_TRANSITIONS=292} [2024-06-28 01:43:04,705 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 214 predicate places. [2024-06-28 01:43:04,705 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 292 transitions, 5441 flow [2024-06-28 01:43:04,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:04,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:04,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 01:43:04,706 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:04,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2100705361, now seen corresponding path program 20 times [2024-06-28 01:43:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11342989] [2024-06-28 01:43:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:05,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11342989] [2024-06-28 01:43:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11342989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:05,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258595198] [2024-06-28 01:43:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:05,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:05,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:05,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 292 transitions, 5441 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:05,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:05,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:05,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:07,373 INFO L124 PetriNetUnfolderBase]: 4175/10101 cut-off events. [2024-06-28 01:43:07,373 INFO L125 PetriNetUnfolderBase]: For 74923/74931 co-relation queries the response was YES. [2024-06-28 01:43:07,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41371 conditions, 10101 events. 4175/10101 cut-off events. For 74923/74931 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 105095 event pairs, 2469 based on Foata normal form. 16/9423 useless extension candidates. Maximal degree in co-relation 41262. Up to 5754 conditions per place. [2024-06-28 01:43:07,451 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 224 selfloop transitions, 100 changer transitions 0/332 dead transitions. [2024-06-28 01:43:07,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 332 transitions, 6349 flow [2024-06-28 01:43:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-28 01:43:07,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015873015873016 [2024-06-28 01:43:07,452 INFO L175 Difference]: Start difference. First operand has 253 places, 292 transitions, 5441 flow. Second operand 9 states and 158 transitions. [2024-06-28 01:43:07,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 332 transitions, 6349 flow [2024-06-28 01:43:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 332 transitions, 6157 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:07,781 INFO L231 Difference]: Finished difference. Result has 254 places, 292 transitions, 5457 flow [2024-06-28 01:43:07,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5249, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5457, PETRI_PLACES=254, PETRI_TRANSITIONS=292} [2024-06-28 01:43:07,781 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 215 predicate places. [2024-06-28 01:43:07,781 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 292 transitions, 5457 flow [2024-06-28 01:43:07,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:07,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:07,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:07,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 01:43:07,782 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:07,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1473320909, now seen corresponding path program 21 times [2024-06-28 01:43:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197154777] [2024-06-28 01:43:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197154777] [2024-06-28 01:43:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197154777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:08,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:08,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:08,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971305725] [2024-06-28 01:43:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:08,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:08,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:08,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:08,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:08,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:08,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 292 transitions, 5457 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:08,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:08,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:08,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:10,357 INFO L124 PetriNetUnfolderBase]: 4305/10055 cut-off events. [2024-06-28 01:43:10,357 INFO L125 PetriNetUnfolderBase]: For 74151/74153 co-relation queries the response was YES. [2024-06-28 01:43:10,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42175 conditions, 10055 events. 4305/10055 cut-off events. For 74151/74153 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 102707 event pairs, 2017 based on Foata normal form. 10/9454 useless extension candidates. Maximal degree in co-relation 42066. Up to 5554 conditions per place. [2024-06-28 01:43:10,472 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 190 selfloop transitions, 144 changer transitions 0/342 dead transitions. [2024-06-28 01:43:10,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 342 transitions, 6562 flow [2024-06-28 01:43:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:43:10,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2024-06-28 01:43:10,473 INFO L175 Difference]: Start difference. First operand has 254 places, 292 transitions, 5457 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:43:10,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 342 transitions, 6562 flow [2024-06-28 01:43:11,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 342 transitions, 6362 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:11,100 INFO L231 Difference]: Finished difference. Result has 255 places, 292 transitions, 5555 flow [2024-06-28 01:43:11,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5555, PETRI_PLACES=255, PETRI_TRANSITIONS=292} [2024-06-28 01:43:11,101 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 216 predicate places. [2024-06-28 01:43:11,101 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 292 transitions, 5555 flow [2024-06-28 01:43:11,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:11,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:11,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:11,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 01:43:11,101 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:11,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1473324629, now seen corresponding path program 22 times [2024-06-28 01:43:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689950900] [2024-06-28 01:43:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:11,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689950900] [2024-06-28 01:43:11,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689950900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:11,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:11,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470835274] [2024-06-28 01:43:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:11,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:11,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 292 transitions, 5555 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:11,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:11,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:11,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:14,008 INFO L124 PetriNetUnfolderBase]: 4447/10776 cut-off events. [2024-06-28 01:43:14,008 INFO L125 PetriNetUnfolderBase]: For 78679/78681 co-relation queries the response was YES. [2024-06-28 01:43:14,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43915 conditions, 10776 events. 4447/10776 cut-off events. For 78679/78681 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 113674 event pairs, 2756 based on Foata normal form. 12/10067 useless extension candidates. Maximal degree in co-relation 43806. Up to 7436 conditions per place. [2024-06-28 01:43:14,119 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 192 selfloop transitions, 132 changer transitions 0/332 dead transitions. [2024-06-28 01:43:14,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 332 transitions, 6493 flow [2024-06-28 01:43:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:43:14,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-28 01:43:14,121 INFO L175 Difference]: Start difference. First operand has 255 places, 292 transitions, 5555 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:43:14,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 332 transitions, 6493 flow [2024-06-28 01:43:14,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 332 transitions, 6207 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:14,526 INFO L231 Difference]: Finished difference. Result has 256 places, 292 transitions, 5545 flow [2024-06-28 01:43:14,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5269, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5545, PETRI_PLACES=256, PETRI_TRANSITIONS=292} [2024-06-28 01:43:14,527 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 217 predicate places. [2024-06-28 01:43:14,527 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 292 transitions, 5545 flow [2024-06-28 01:43:14,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:14,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:14,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:14,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 01:43:14,528 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:14,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1479038921, now seen corresponding path program 4 times [2024-06-28 01:43:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:14,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780505319] [2024-06-28 01:43:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780505319] [2024-06-28 01:43:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780505319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:15,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:15,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204420439] [2024-06-28 01:43:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:15,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:15,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:15,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:15,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:15,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 292 transitions, 5545 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:15,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:15,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:15,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:17,282 INFO L124 PetriNetUnfolderBase]: 4442/10768 cut-off events. [2024-06-28 01:43:17,282 INFO L125 PetriNetUnfolderBase]: For 71136/71141 co-relation queries the response was YES. [2024-06-28 01:43:17,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43808 conditions, 10768 events. 4442/10768 cut-off events. For 71136/71141 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 113774 event pairs, 2822 based on Foata normal form. 7/10027 useless extension candidates. Maximal degree in co-relation 43699. Up to 8154 conditions per place. [2024-06-28 01:43:17,406 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 244 selfloop transitions, 65 changer transitions 0/317 dead transitions. [2024-06-28 01:43:17,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 317 transitions, 6336 flow [2024-06-28 01:43:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:43:17,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 01:43:17,408 INFO L175 Difference]: Start difference. First operand has 256 places, 292 transitions, 5545 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:43:17,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 317 transitions, 6336 flow [2024-06-28 01:43:17,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 317 transitions, 6072 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:17,835 INFO L231 Difference]: Finished difference. Result has 256 places, 293 transitions, 5441 flow [2024-06-28 01:43:17,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5285, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5441, PETRI_PLACES=256, PETRI_TRANSITIONS=293} [2024-06-28 01:43:17,836 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 217 predicate places. [2024-06-28 01:43:17,836 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 293 transitions, 5441 flow [2024-06-28 01:43:17,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:17,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:17,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:17,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 01:43:17,837 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:17,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1473474731, now seen corresponding path program 5 times [2024-06-28 01:43:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225843659] [2024-06-28 01:43:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:18,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225843659] [2024-06-28 01:43:18,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225843659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:18,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:18,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332131691] [2024-06-28 01:43:18,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:18,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:18,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:18,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:18,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 293 transitions, 5441 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:18,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:18,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:20,553 INFO L124 PetriNetUnfolderBase]: 4616/11189 cut-off events. [2024-06-28 01:43:20,553 INFO L125 PetriNetUnfolderBase]: For 85901/85903 co-relation queries the response was YES. [2024-06-28 01:43:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45095 conditions, 11189 events. 4616/11189 cut-off events. For 85901/85903 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 118904 event pairs, 2945 based on Foata normal form. 20/10458 useless extension candidates. Maximal degree in co-relation 44986. Up to 7812 conditions per place. [2024-06-28 01:43:20,674 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 253 selfloop transitions, 69 changer transitions 0/330 dead transitions. [2024-06-28 01:43:20,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 330 transitions, 6368 flow [2024-06-28 01:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:43:20,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-28 01:43:20,676 INFO L175 Difference]: Start difference. First operand has 256 places, 293 transitions, 5441 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:43:20,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 330 transitions, 6368 flow [2024-06-28 01:43:21,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 330 transitions, 6277 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:43:21,163 INFO L231 Difference]: Finished difference. Result has 261 places, 293 transitions, 5504 flow [2024-06-28 01:43:21,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5350, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5504, PETRI_PLACES=261, PETRI_TRANSITIONS=293} [2024-06-28 01:43:21,163 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 222 predicate places. [2024-06-28 01:43:21,163 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 293 transitions, 5504 flow [2024-06-28 01:43:21,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:21,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:21,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:21,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 01:43:21,164 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:21,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1479046361, now seen corresponding path program 6 times [2024-06-28 01:43:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305114891] [2024-06-28 01:43:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305114891] [2024-06-28 01:43:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305114891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978342371] [2024-06-28 01:43:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:21,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:21,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:21,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 293 transitions, 5504 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:21,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:21,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:21,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:23,764 INFO L124 PetriNetUnfolderBase]: 4633/11237 cut-off events. [2024-06-28 01:43:23,764 INFO L125 PetriNetUnfolderBase]: For 74304/74309 co-relation queries the response was YES. [2024-06-28 01:43:23,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45282 conditions, 11237 events. 4633/11237 cut-off events. For 74304/74309 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 119709 event pairs, 2899 based on Foata normal form. 7/10480 useless extension candidates. Maximal degree in co-relation 45172. Up to 8261 conditions per place. [2024-06-28 01:43:23,884 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 248 selfloop transitions, 62 changer transitions 0/318 dead transitions. [2024-06-28 01:43:23,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 318 transitions, 6286 flow [2024-06-28 01:43:23,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:43:23,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 01:43:23,885 INFO L175 Difference]: Start difference. First operand has 261 places, 293 transitions, 5504 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:43:23,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 318 transitions, 6286 flow [2024-06-28 01:43:24,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 318 transitions, 6154 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:24,378 INFO L231 Difference]: Finished difference. Result has 261 places, 295 transitions, 5543 flow [2024-06-28 01:43:24,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5372, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5543, PETRI_PLACES=261, PETRI_TRANSITIONS=295} [2024-06-28 01:43:24,378 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 222 predicate places. [2024-06-28 01:43:24,378 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 295 transitions, 5543 flow [2024-06-28 01:43:24,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:24,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:24,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:24,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 01:43:24,379 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:24,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1478831159, now seen corresponding path program 23 times [2024-06-28 01:43:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241537664] [2024-06-28 01:43:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:25,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241537664] [2024-06-28 01:43:25,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241537664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:25,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:25,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635326842] [2024-06-28 01:43:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:25,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:25,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:25,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:25,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:25,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:25,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 295 transitions, 5543 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:25,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:25,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:25,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:27,406 INFO L124 PetriNetUnfolderBase]: 4820/11763 cut-off events. [2024-06-28 01:43:27,406 INFO L125 PetriNetUnfolderBase]: For 82148/82153 co-relation queries the response was YES. [2024-06-28 01:43:27,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46972 conditions, 11763 events. 4820/11763 cut-off events. For 82148/82153 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 126761 event pairs, 3102 based on Foata normal form. 15/10973 useless extension candidates. Maximal degree in co-relation 46862. Up to 8246 conditions per place. [2024-06-28 01:43:27,507 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 250 selfloop transitions, 66 changer transitions 0/324 dead transitions. [2024-06-28 01:43:27,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 324 transitions, 6349 flow [2024-06-28 01:43:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 01:43:27,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-28 01:43:27,508 INFO L175 Difference]: Start difference. First operand has 261 places, 295 transitions, 5543 flow. Second operand 9 states and 147 transitions. [2024-06-28 01:43:27,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 324 transitions, 6349 flow [2024-06-28 01:43:27,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 324 transitions, 6264 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:27,904 INFO L231 Difference]: Finished difference. Result has 265 places, 295 transitions, 5604 flow [2024-06-28 01:43:27,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5458, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5604, PETRI_PLACES=265, PETRI_TRANSITIONS=295} [2024-06-28 01:43:27,904 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 226 predicate places. [2024-06-28 01:43:27,904 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 295 transitions, 5604 flow [2024-06-28 01:43:27,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:27,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:27,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:27,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 01:43:27,905 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:27,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1883893265, now seen corresponding path program 7 times [2024-06-28 01:43:27,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:27,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246303552] [2024-06-28 01:43:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246303552] [2024-06-28 01:43:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246303552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380071877] [2024-06-28 01:43:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:28,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:28,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:28,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 295 transitions, 5604 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:28,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:28,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:30,685 INFO L124 PetriNetUnfolderBase]: 4837/11787 cut-off events. [2024-06-28 01:43:30,685 INFO L125 PetriNetUnfolderBase]: For 73651/73653 co-relation queries the response was YES. [2024-06-28 01:43:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47263 conditions, 11787 events. 4837/11787 cut-off events. For 73651/73653 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 126873 event pairs, 3049 based on Foata normal form. 4/10987 useless extension candidates. Maximal degree in co-relation 47152. Up to 8833 conditions per place. [2024-06-28 01:43:30,826 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 231 selfloop transitions, 82 changer transitions 0/321 dead transitions. [2024-06-28 01:43:30,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 321 transitions, 6445 flow [2024-06-28 01:43:30,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-28 01:43:30,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-28 01:43:30,827 INFO L175 Difference]: Start difference. First operand has 265 places, 295 transitions, 5604 flow. Second operand 7 states and 124 transitions. [2024-06-28 01:43:30,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 321 transitions, 6445 flow [2024-06-28 01:43:31,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 321 transitions, 6319 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:31,317 INFO L231 Difference]: Finished difference. Result has 264 places, 296 transitions, 5684 flow [2024-06-28 01:43:31,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5478, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5684, PETRI_PLACES=264, PETRI_TRANSITIONS=296} [2024-06-28 01:43:31,317 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 225 predicate places. [2024-06-28 01:43:31,317 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 296 transitions, 5684 flow [2024-06-28 01:43:31,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:31,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:31,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:31,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 01:43:31,318 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:31,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1883885825, now seen corresponding path program 8 times [2024-06-28 01:43:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:31,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629126068] [2024-06-28 01:43:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629126068] [2024-06-28 01:43:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629126068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317950015] [2024-06-28 01:43:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:32,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:32,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:32,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 296 transitions, 5684 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:32,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:32,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:34,006 INFO L124 PetriNetUnfolderBase]: 4854/11836 cut-off events. [2024-06-28 01:43:34,007 INFO L125 PetriNetUnfolderBase]: For 76362/76367 co-relation queries the response was YES. [2024-06-28 01:43:34,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47688 conditions, 11836 events. 4854/11836 cut-off events. For 76362/76367 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 127651 event pairs, 3041 based on Foata normal form. 7/11034 useless extension candidates. Maximal degree in co-relation 47577. Up to 8558 conditions per place. [2024-06-28 01:43:34,151 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 235 selfloop transitions, 75 changer transitions 0/318 dead transitions. [2024-06-28 01:43:34,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 318 transitions, 6436 flow [2024-06-28 01:43:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 01:43:34,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-06-28 01:43:34,152 INFO L175 Difference]: Start difference. First operand has 264 places, 296 transitions, 5684 flow. Second operand 7 states and 122 transitions. [2024-06-28 01:43:34,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 318 transitions, 6436 flow [2024-06-28 01:43:34,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 318 transitions, 6268 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:34,666 INFO L231 Difference]: Finished difference. Result has 266 places, 297 transitions, 5699 flow [2024-06-28 01:43:34,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5520, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5699, PETRI_PLACES=266, PETRI_TRANSITIONS=297} [2024-06-28 01:43:34,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 227 predicate places. [2024-06-28 01:43:34,666 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 297 transitions, 5699 flow [2024-06-28 01:43:34,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:34,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:34,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:34,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 01:43:34,667 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:34,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1884101027, now seen corresponding path program 24 times [2024-06-28 01:43:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495858380] [2024-06-28 01:43:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495858380] [2024-06-28 01:43:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495858380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:35,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194875501] [2024-06-28 01:43:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:35,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:35,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:35,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 297 transitions, 5699 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:35,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:35,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:35,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:37,573 INFO L124 PetriNetUnfolderBase]: 4863/11663 cut-off events. [2024-06-28 01:43:37,573 INFO L125 PetriNetUnfolderBase]: For 72704/72706 co-relation queries the response was YES. [2024-06-28 01:43:37,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47291 conditions, 11663 events. 4863/11663 cut-off events. For 72704/72706 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 124172 event pairs, 2606 based on Foata normal form. 12/10942 useless extension candidates. Maximal degree in co-relation 47179. Up to 8392 conditions per place. [2024-06-28 01:43:37,717 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 237 selfloop transitions, 90 changer transitions 0/335 dead transitions. [2024-06-28 01:43:37,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 335 transitions, 6627 flow [2024-06-28 01:43:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:43:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:43:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:43:37,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-28 01:43:37,718 INFO L175 Difference]: Start difference. First operand has 266 places, 297 transitions, 5699 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:43:37,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 335 transitions, 6627 flow [2024-06-28 01:43:38,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 335 transitions, 6463 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 01:43:38,153 INFO L231 Difference]: Finished difference. Result has 268 places, 297 transitions, 5747 flow [2024-06-28 01:43:38,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5535, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5747, PETRI_PLACES=268, PETRI_TRANSITIONS=297} [2024-06-28 01:43:38,154 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 229 predicate places. [2024-06-28 01:43:38,154 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 297 transitions, 5747 flow [2024-06-28 01:43:38,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:38,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:38,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:38,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 01:43:38,154 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:38,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1053806969, now seen corresponding path program 9 times [2024-06-28 01:43:38,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:38,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028327774] [2024-06-28 01:43:38,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028327774] [2024-06-28 01:43:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028327774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:43:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420125574] [2024-06-28 01:43:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:38,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:43:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:43:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:43:39,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:39,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 297 transitions, 5747 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:39,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:39,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:39,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:41,132 INFO L124 PetriNetUnfolderBase]: 4864/11892 cut-off events. [2024-06-28 01:43:41,132 INFO L125 PetriNetUnfolderBase]: For 65071/65076 co-relation queries the response was YES. [2024-06-28 01:43:41,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47483 conditions, 11892 events. 4864/11892 cut-off events. For 65071/65076 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 128507 event pairs, 3537 based on Foata normal form. 3/11110 useless extension candidates. Maximal degree in co-relation 47371. Up to 9194 conditions per place. [2024-06-28 01:43:41,255 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 298 selfloop transitions, 12 changer transitions 0/318 dead transitions. [2024-06-28 01:43:41,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 318 transitions, 6495 flow [2024-06-28 01:43:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:43:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:43:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 01:43:41,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-28 01:43:41,256 INFO L175 Difference]: Start difference. First operand has 268 places, 297 transitions, 5747 flow. Second operand 7 states and 116 transitions. [2024-06-28 01:43:41,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 318 transitions, 6495 flow [2024-06-28 01:43:41,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 318 transitions, 6287 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-28 01:43:41,666 INFO L231 Difference]: Finished difference. Result has 267 places, 298 transitions, 5587 flow [2024-06-28 01:43:41,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5539, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5587, PETRI_PLACES=267, PETRI_TRANSITIONS=298} [2024-06-28 01:43:41,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 228 predicate places. [2024-06-28 01:43:41,666 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 298 transitions, 5587 flow [2024-06-28 01:43:41,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:41,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:41,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:41,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 01:43:41,667 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:41,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 81533133, now seen corresponding path program 1 times [2024-06-28 01:43:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207093337] [2024-06-28 01:43:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:42,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207093337] [2024-06-28 01:43:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207093337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:43:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127832204] [2024-06-28 01:43:42,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:42,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:43:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:42,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:43:42,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:43:42,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:42,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 298 transitions, 5587 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:42,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:42,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:42,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:45,129 INFO L124 PetriNetUnfolderBase]: 4901/11991 cut-off events. [2024-06-28 01:43:45,129 INFO L125 PetriNetUnfolderBase]: For 65907/65912 co-relation queries the response was YES. [2024-06-28 01:43:45,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47195 conditions, 11991 events. 4901/11991 cut-off events. For 65907/65912 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 129893 event pairs, 3151 based on Foata normal form. 11/11173 useless extension candidates. Maximal degree in co-relation 47083. Up to 8726 conditions per place. [2024-06-28 01:43:45,302 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 281 selfloop transitions, 55 changer transitions 0/344 dead transitions. [2024-06-28 01:43:45,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 344 transitions, 6506 flow [2024-06-28 01:43:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:43:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:43:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2024-06-28 01:43:45,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:43:45,303 INFO L175 Difference]: Start difference. First operand has 267 places, 298 transitions, 5587 flow. Second operand 12 states and 200 transitions. [2024-06-28 01:43:45,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 344 transitions, 6506 flow [2024-06-28 01:43:45,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 344 transitions, 6470 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:43:45,981 INFO L231 Difference]: Finished difference. Result has 274 places, 298 transitions, 5664 flow [2024-06-28 01:43:45,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5551, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5664, PETRI_PLACES=274, PETRI_TRANSITIONS=298} [2024-06-28 01:43:45,982 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 235 predicate places. [2024-06-28 01:43:45,982 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 298 transitions, 5664 flow [2024-06-28 01:43:45,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:45,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:45,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:45,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 01:43:45,982 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:45,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:45,983 INFO L85 PathProgramCache]: Analyzing trace with hash 88019883, now seen corresponding path program 2 times [2024-06-28 01:43:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:45,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546386815] [2024-06-28 01:43:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:45,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:46,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546386815] [2024-06-28 01:43:46,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546386815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:46,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:46,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:43:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691895936] [2024-06-28 01:43:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:46,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:43:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:46,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:43:46,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:43:47,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:47,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 298 transitions, 5664 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:47,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:47,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:47,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:49,504 INFO L124 PetriNetUnfolderBase]: 4971/12124 cut-off events. [2024-06-28 01:43:49,504 INFO L125 PetriNetUnfolderBase]: For 67894/67896 co-relation queries the response was YES. [2024-06-28 01:43:49,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48075 conditions, 12124 events. 4971/12124 cut-off events. For 67894/67896 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 131221 event pairs, 3369 based on Foata normal form. 6/11306 useless extension candidates. Maximal degree in co-relation 47962. Up to 9111 conditions per place. [2024-06-28 01:43:49,642 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 296 selfloop transitions, 53 changer transitions 0/357 dead transitions. [2024-06-28 01:43:49,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 357 transitions, 6981 flow [2024-06-28 01:43:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:43:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:43:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2024-06-28 01:43:49,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-28 01:43:49,643 INFO L175 Difference]: Start difference. First operand has 274 places, 298 transitions, 5664 flow. Second operand 13 states and 210 transitions. [2024-06-28 01:43:49,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 357 transitions, 6981 flow [2024-06-28 01:43:50,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 357 transitions, 6850 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:43:50,123 INFO L231 Difference]: Finished difference. Result has 284 places, 312 transitions, 6103 flow [2024-06-28 01:43:50,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5559, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6103, PETRI_PLACES=284, PETRI_TRANSITIONS=312} [2024-06-28 01:43:50,123 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 245 predicate places. [2024-06-28 01:43:50,123 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 312 transitions, 6103 flow [2024-06-28 01:43:50,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:50,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:50,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:50,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 01:43:50,124 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:50,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -495245139, now seen corresponding path program 3 times [2024-06-28 01:43:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272016881] [2024-06-28 01:43:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272016881] [2024-06-28 01:43:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272016881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:51,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:51,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:43:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629049457] [2024-06-28 01:43:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:51,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:43:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:51,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:43:51,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:43:51,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:51,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 312 transitions, 6103 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:51,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:51,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:51,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:53,470 INFO L124 PetriNetUnfolderBase]: 5008/12209 cut-off events. [2024-06-28 01:43:53,470 INFO L125 PetriNetUnfolderBase]: For 70431/70439 co-relation queries the response was YES. [2024-06-28 01:43:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48653 conditions, 12209 events. 5008/12209 cut-off events. For 70431/70439 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 132249 event pairs, 3174 based on Foata normal form. 14/11405 useless extension candidates. Maximal degree in co-relation 48533. Up to 9011 conditions per place. [2024-06-28 01:43:53,579 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 265 selfloop transitions, 71 changer transitions 0/344 dead transitions. [2024-06-28 01:43:53,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 344 transitions, 7029 flow [2024-06-28 01:43:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:43:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:43:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:43:53,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:43:53,580 INFO L175 Difference]: Start difference. First operand has 284 places, 312 transitions, 6103 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:43:53,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 344 transitions, 7029 flow [2024-06-28 01:43:54,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 344 transitions, 6919 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-28 01:43:54,145 INFO L231 Difference]: Finished difference. Result has 286 places, 312 transitions, 6145 flow [2024-06-28 01:43:54,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5997, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6145, PETRI_PLACES=286, PETRI_TRANSITIONS=312} [2024-06-28 01:43:54,145 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 247 predicate places. [2024-06-28 01:43:54,145 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 312 transitions, 6145 flow [2024-06-28 01:43:54,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:54,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:54,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:54,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 01:43:54,146 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:54,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1394432927, now seen corresponding path program 4 times [2024-06-28 01:43:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104600430] [2024-06-28 01:43:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:55,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104600430] [2024-06-28 01:43:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104600430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:43:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045318778] [2024-06-28 01:43:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:55,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:43:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:43:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:43:55,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:55,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 312 transitions, 6145 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:55,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:55,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:55,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:57,631 INFO L124 PetriNetUnfolderBase]: 5045/12340 cut-off events. [2024-06-28 01:43:57,631 INFO L125 PetriNetUnfolderBase]: For 71124/71129 co-relation queries the response was YES. [2024-06-28 01:43:57,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49107 conditions, 12340 events. 5045/12340 cut-off events. For 71124/71129 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 134109 event pairs, 3239 based on Foata normal form. 11/11523 useless extension candidates. Maximal degree in co-relation 48986. Up to 8390 conditions per place. [2024-06-28 01:43:57,801 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 247 selfloop transitions, 98 changer transitions 0/353 dead transitions. [2024-06-28 01:43:57,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 353 transitions, 7083 flow [2024-06-28 01:43:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:43:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:43:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-06-28 01:43:57,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649350649350649 [2024-06-28 01:43:57,802 INFO L175 Difference]: Start difference. First operand has 286 places, 312 transitions, 6145 flow. Second operand 11 states and 179 transitions. [2024-06-28 01:43:57,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 353 transitions, 7083 flow [2024-06-28 01:43:58,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 353 transitions, 6945 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:43:58,406 INFO L231 Difference]: Finished difference. Result has 290 places, 312 transitions, 6207 flow [2024-06-28 01:43:58,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6007, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6207, PETRI_PLACES=290, PETRI_TRANSITIONS=312} [2024-06-28 01:43:58,407 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 251 predicate places. [2024-06-28 01:43:58,407 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 312 transitions, 6207 flow [2024-06-28 01:43:58,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:58,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:58,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:58,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 01:43:58,407 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:43:58,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1394202287, now seen corresponding path program 5 times [2024-06-28 01:43:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846197238] [2024-06-28 01:43:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:59,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846197238] [2024-06-28 01:43:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846197238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:59,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:43:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865621306] [2024-06-28 01:43:59,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:59,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:43:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:59,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:43:59,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:43:59,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:43:59,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 312 transitions, 6207 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:59,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:59,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:43:59,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:01,961 INFO L124 PetriNetUnfolderBase]: 5082/12411 cut-off events. [2024-06-28 01:44:01,961 INFO L125 PetriNetUnfolderBase]: For 72810/72815 co-relation queries the response was YES. [2024-06-28 01:44:02,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49501 conditions, 12411 events. 5082/12411 cut-off events. For 72810/72815 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 134963 event pairs, 3202 based on Foata normal form. 11/11597 useless extension candidates. Maximal degree in co-relation 49379. Up to 8958 conditions per place. [2024-06-28 01:44:02,114 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 262 selfloop transitions, 73 changer transitions 0/343 dead transitions. [2024-06-28 01:44:02,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 343 transitions, 7047 flow [2024-06-28 01:44:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:44:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:44:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:44:02,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:44:02,115 INFO L175 Difference]: Start difference. First operand has 290 places, 312 transitions, 6207 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:44:02,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 343 transitions, 7047 flow [2024-06-28 01:44:02,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 343 transitions, 6835 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-28 01:44:02,658 INFO L231 Difference]: Finished difference. Result has 288 places, 312 transitions, 6145 flow [2024-06-28 01:44:02,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5995, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6145, PETRI_PLACES=288, PETRI_TRANSITIONS=312} [2024-06-28 01:44:02,659 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-28 01:44:02,659 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 312 transitions, 6145 flow [2024-06-28 01:44:02,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:02,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:02,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:02,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 01:44:02,660 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:02,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1728851707, now seen corresponding path program 6 times [2024-06-28 01:44:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022672960] [2024-06-28 01:44:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022672960] [2024-06-28 01:44:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022672960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914730435] [2024-06-28 01:44:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:03,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:03,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:44:03,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 312 transitions, 6145 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:03,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:03,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:44:03,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:06,221 INFO L124 PetriNetUnfolderBase]: 5119/12559 cut-off events. [2024-06-28 01:44:06,221 INFO L125 PetriNetUnfolderBase]: For 72573/72575 co-relation queries the response was YES. [2024-06-28 01:44:06,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49859 conditions, 12559 events. 5119/12559 cut-off events. For 72573/72575 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 137170 event pairs, 3553 based on Foata normal form. 8/11710 useless extension candidates. Maximal degree in co-relation 49737. Up to 9552 conditions per place. [2024-06-28 01:44:06,341 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 280 selfloop transitions, 55 changer transitions 0/343 dead transitions. [2024-06-28 01:44:06,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 343 transitions, 7013 flow [2024-06-28 01:44:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:44:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:44:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 01:44:06,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-28 01:44:06,342 INFO L175 Difference]: Start difference. First operand has 288 places, 312 transitions, 6145 flow. Second operand 8 states and 141 transitions. [2024-06-28 01:44:06,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 343 transitions, 7013 flow [2024-06-28 01:44:06,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 343 transitions, 6866 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:44:06,864 INFO L231 Difference]: Finished difference. Result has 288 places, 312 transitions, 6111 flow [2024-06-28 01:44:06,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5998, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6111, PETRI_PLACES=288, PETRI_TRANSITIONS=312} [2024-06-28 01:44:06,865 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-28 01:44:06,865 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 312 transitions, 6111 flow [2024-06-28 01:44:06,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:06,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:06,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:06,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 01:44:06,865 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:06,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1729082347, now seen corresponding path program 7 times [2024-06-28 01:44:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600167718] [2024-06-28 01:44:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:07,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:07,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600167718] [2024-06-28 01:44:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600167718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:07,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:07,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31506528] [2024-06-28 01:44:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:07,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:44:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:44:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:44:07,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:44:07,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 312 transitions, 6111 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:07,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:07,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:44:07,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:10,135 INFO L124 PetriNetUnfolderBase]: 5156/12644 cut-off events. [2024-06-28 01:44:10,135 INFO L125 PetriNetUnfolderBase]: For 71905/71910 co-relation queries the response was YES. [2024-06-28 01:44:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49944 conditions, 12644 events. 5156/12644 cut-off events. For 71905/71910 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 138273 event pairs, 3577 based on Foata normal form. 11/11800 useless extension candidates. Maximal degree in co-relation 49822. Up to 9571 conditions per place. [2024-06-28 01:44:10,282 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 288 selfloop transitions, 45 changer transitions 0/341 dead transitions. [2024-06-28 01:44:10,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 341 transitions, 6933 flow [2024-06-28 01:44:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:44:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:44:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 01:44:10,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49642857142857144 [2024-06-28 01:44:10,283 INFO L175 Difference]: Start difference. First operand has 288 places, 312 transitions, 6111 flow. Second operand 8 states and 139 transitions. [2024-06-28 01:44:10,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 341 transitions, 6933 flow [2024-06-28 01:44:10,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 341 transitions, 6829 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 01:44:10,936 INFO L231 Difference]: Finished difference. Result has 291 places, 312 transitions, 6100 flow [2024-06-28 01:44:10,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6007, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6100, PETRI_PLACES=291, PETRI_TRANSITIONS=312} [2024-06-28 01:44:10,936 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 252 predicate places. [2024-06-28 01:44:10,937 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 312 transitions, 6100 flow [2024-06-28 01:44:10,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:10,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:10,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:10,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 01:44:10,937 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:10,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2032623701, now seen corresponding path program 8 times [2024-06-28 01:44:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:10,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23387870] [2024-06-28 01:44:10,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:11,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:11,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23387870] [2024-06-28 01:44:11,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23387870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:11,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:11,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:44:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978416189] [2024-06-28 01:44:11,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:11,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:44:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:44:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:44:11,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:44:11,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 312 transitions, 6100 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:11,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:11,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:44:11,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:14,168 INFO L124 PetriNetUnfolderBase]: 5149/12624 cut-off events. [2024-06-28 01:44:14,168 INFO L125 PetriNetUnfolderBase]: For 65487/65492 co-relation queries the response was YES. [2024-06-28 01:44:14,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49626 conditions, 12624 events. 5149/12624 cut-off events. For 65487/65492 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 137770 event pairs, 3743 based on Foata normal form. 7/11822 useless extension candidates. Maximal degree in co-relation 49503. Up to 9671 conditions per place. [2024-06-28 01:44:14,306 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 318 selfloop transitions, 14 changer transitions 0/340 dead transitions. [2024-06-28 01:44:14,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 340 transitions, 6822 flow [2024-06-28 01:44:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:44:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:44:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 01:44:14,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 01:44:14,307 INFO L175 Difference]: Start difference. First operand has 291 places, 312 transitions, 6100 flow. Second operand 8 states and 132 transitions. [2024-06-28 01:44:14,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 340 transitions, 6822 flow [2024-06-28 01:44:14,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 340 transitions, 6287 flow, removed 8 selfloop flow, removed 42 redundant places. [2024-06-28 01:44:14,799 INFO L231 Difference]: Finished difference. Result has 255 places, 311 transitions, 5499 flow [2024-06-28 01:44:14,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5471, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5499, PETRI_PLACES=255, PETRI_TRANSITIONS=311} [2024-06-28 01:44:14,800 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 216 predicate places. [2024-06-28 01:44:14,800 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 311 transitions, 5499 flow [2024-06-28 01:44:14,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:14,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:14,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:14,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 01:44:14,801 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:14,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1299499120, now seen corresponding path program 1 times [2024-06-28 01:44:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343684939] [2024-06-28 01:44:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343684939] [2024-06-28 01:44:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343684939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:14,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:44:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153947462] [2024-06-28 01:44:14,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:14,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:44:14,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:14,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:44:14,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:44:14,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 01:44:14,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 311 transitions, 5499 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-28 01:44:14,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:14,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 01:44:14,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:16,147 INFO L124 PetriNetUnfolderBase]: 3591/8793 cut-off events. [2024-06-28 01:44:16,147 INFO L125 PetriNetUnfolderBase]: For 36081/36292 co-relation queries the response was YES. [2024-06-28 01:44:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33745 conditions, 8793 events. 3591/8793 cut-off events. For 36081/36292 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 88557 event pairs, 812 based on Foata normal form. 895/9269 useless extension candidates. Maximal degree in co-relation 33659. Up to 2765 conditions per place. [2024-06-28 01:44:16,208 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 129 selfloop transitions, 124 changer transitions 0/317 dead transitions. [2024-06-28 01:44:16,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 317 transitions, 5980 flow [2024-06-28 01:44:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:44:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:44:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-28 01:44:16,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2024-06-28 01:44:16,209 INFO L175 Difference]: Start difference. First operand has 255 places, 311 transitions, 5499 flow. Second operand 5 states and 107 transitions. [2024-06-28 01:44:16,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 317 transitions, 5980 flow [2024-06-28 01:44:16,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 317 transitions, 5640 flow, removed 46 selfloop flow, removed 21 redundant places. [2024-06-28 01:44:16,390 INFO L231 Difference]: Finished difference. Result has 240 places, 308 transitions, 5491 flow [2024-06-28 01:44:16,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5108, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5491, PETRI_PLACES=240, PETRI_TRANSITIONS=308} [2024-06-28 01:44:16,391 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 201 predicate places. [2024-06-28 01:44:16,391 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 308 transitions, 5491 flow [2024-06-28 01:44:16,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-28 01:44:16,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:16,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:16,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 01:44:16,392 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:16,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1044455013, now seen corresponding path program 1 times [2024-06-28 01:44:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285705640] [2024-06-28 01:44:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:16,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285705640] [2024-06-28 01:44:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285705640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:16,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:16,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:16,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374143658] [2024-06-28 01:44:16,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:16,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:44:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:44:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:44:16,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:44:16,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 308 transitions, 5491 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:16,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:16,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:44:16,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:17,960 INFO L124 PetriNetUnfolderBase]: 3180/8591 cut-off events. [2024-06-28 01:44:17,961 INFO L125 PetriNetUnfolderBase]: For 29144/29202 co-relation queries the response was YES. [2024-06-28 01:44:18,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32127 conditions, 8591 events. 3180/8591 cut-off events. For 29144/29202 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 93927 event pairs, 1381 based on Foata normal form. 205/8344 useless extension candidates. Maximal degree in co-relation 32053. Up to 2854 conditions per place. [2024-06-28 01:44:18,034 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 55 selfloop transitions, 54 changer transitions 205/388 dead transitions. [2024-06-28 01:44:18,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 388 transitions, 6615 flow [2024-06-28 01:44:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:44:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:44:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 228 transitions. [2024-06-28 01:44:18,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010989010989011 [2024-06-28 01:44:18,035 INFO L175 Difference]: Start difference. First operand has 240 places, 308 transitions, 5491 flow. Second operand 13 states and 228 transitions. [2024-06-28 01:44:18,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 388 transitions, 6615 flow [2024-06-28 01:44:18,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 388 transitions, 6367 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 01:44:18,231 INFO L231 Difference]: Finished difference. Result has 257 places, 168 transitions, 3050 flow [2024-06-28 01:44:18,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5243, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3050, PETRI_PLACES=257, PETRI_TRANSITIONS=168} [2024-06-28 01:44:18,232 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 218 predicate places. [2024-06-28 01:44:18,232 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 168 transitions, 3050 flow [2024-06-28 01:44:18,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:18,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:18,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:18,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 01:44:18,232 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:18,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 215233177, now seen corresponding path program 2 times [2024-06-28 01:44:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593771074] [2024-06-28 01:44:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:44:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:44:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:44:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593771074] [2024-06-28 01:44:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593771074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:44:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:44:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:44:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537742179] [2024-06-28 01:44:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:44:18,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:44:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:44:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:44:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:44:18,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-06-28 01:44:18,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 168 transitions, 3050 flow. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:18,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:44:18,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-06-28 01:44:18,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:44:19,512 INFO L124 PetriNetUnfolderBase]: 1562/4220 cut-off events. [2024-06-28 01:44:19,512 INFO L125 PetriNetUnfolderBase]: For 18028/18074 co-relation queries the response was YES. [2024-06-28 01:44:19,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17799 conditions, 4220 events. 1562/4220 cut-off events. For 18028/18074 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 41131 event pairs, 402 based on Foata normal form. 99/4072 useless extension candidates. Maximal degree in co-relation 17729. Up to 1250 conditions per place. [2024-06-28 01:44:19,543 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 45 selfloop transitions, 23 changer transitions 88/207 dead transitions. [2024-06-28 01:44:19,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 207 transitions, 3507 flow [2024-06-28 01:44:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:44:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:44:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:44:19,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-28 01:44:19,544 INFO L175 Difference]: Start difference. First operand has 257 places, 168 transitions, 3050 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:44:19,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 207 transitions, 3507 flow [2024-06-28 01:44:19,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 207 transitions, 2706 flow, removed 48 selfloop flow, removed 52 redundant places. [2024-06-28 01:44:19,618 INFO L231 Difference]: Finished difference. Result has 174 places, 104 transitions, 1320 flow [2024-06-28 01:44:19,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1320, PETRI_PLACES=174, PETRI_TRANSITIONS=104} [2024-06-28 01:44:19,618 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 135 predicate places. [2024-06-28 01:44:19,618 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 104 transitions, 1320 flow [2024-06-28 01:44:19,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:44:19,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:44:19,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:19,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 01:44:19,619 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:44:19,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:44:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1532475723, now seen corresponding path program 3 times [2024-06-28 01:44:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:44:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174125183] [2024-06-28 01:44:19,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:44:19,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:44:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:44:19,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:44:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:44:19,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:44:19,675 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:44:19,675 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 01:44:19,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 01:44:19,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 01:44:19,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 01:44:19,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 01:44:19,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 01:44:19,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 01:44:19,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 01:44:19,679 INFO L445 BasicCegarLoop]: Path program histogram: [24, 13, 9, 9, 8, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:44:19,684 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:44:19,685 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:44:19,749 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:44:19,749 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:44:19,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:44:19 BasicIcfg [2024-06-28 01:44:19,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:44:19,750 INFO L158 Benchmark]: Toolchain (without parser) took 193133.82ms. Allocated memory was 157.3MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 97.5MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 157.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.87ms. Allocated memory is still 157.3MB. Free memory was 97.1MB in the beginning and 64.7MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.92ms. Allocated memory is still 157.3MB. Free memory was 64.7MB in the beginning and 61.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: Boogie Preprocessor took 73.23ms. Allocated memory is still 157.3MB. Free memory was 61.9MB in the beginning and 58.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: RCFGBuilder took 779.95ms. Allocated memory is still 157.3MB. Free memory was 58.8MB in the beginning and 95.8MB in the end (delta: -37.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-28 01:44:19,751 INFO L158 Benchmark]: TraceAbstraction took 191525.99ms. Allocated memory was 157.3MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 95.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-06-28 01:44:19,753 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.22ms. Allocated memory is still 157.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.87ms. Allocated memory is still 157.3MB. Free memory was 97.1MB in the beginning and 64.7MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.92ms. Allocated memory is still 157.3MB. Free memory was 64.7MB in the beginning and 61.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.23ms. Allocated memory is still 157.3MB. Free memory was 61.9MB in the beginning and 58.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 779.95ms. Allocated memory is still 157.3MB. Free memory was 58.8MB in the beginning and 95.8MB in the end (delta: -37.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 191525.99ms. Allocated memory was 157.3MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 95.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 0 //@ assert ((((((((((((((!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L809] 0 //@ assert ((((((((((((((!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 806]: 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: 808]: 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 5 procedures, 52 locations, 7 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: 191.4s, OverallIterations: 90, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 128.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5887 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5089 mSDsluCounter, 4113 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3643 mSDsCounter, 1441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34661 IncrementalHoareTripleChecker+Invalid, 36102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1441 mSolverCounterUnsat, 470 mSDtfsCounter, 34661 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7547occurred in iteration=44, InterpolantAutomatonStates: 742, 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.8s SatisfiabilityAnalysisTime, 61.3s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 1253 ConstructedInterpolants, 0 QuantifiedInterpolants, 48413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 89 InterpolantComputations, 89 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-28 01:44:19,779 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