./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/protection/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:30:05,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:30:05,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:30:05,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:30:05,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:30:05,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:30:05,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:30:05,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:30:05,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:30:05,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:30:05,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:30:05,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:30:05,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:30:05,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:30:05,609 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:30:05,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:30:05,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:30:05,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:30:05,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:30:05,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:30:05,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:30:05,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:30:05,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:30:05,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:30:05,611 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:30:05,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:30:05,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:30:05,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:30:05,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:30:05,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:30:05,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:30:05,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:30:05,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:30:05,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:30:05,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:30:05,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:30:05,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:30:05,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:30:05,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:30:05,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:30:05,615 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:30:05,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:30:05,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:30:05,615 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-05-12 13:30:05,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:30:05,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:30:05,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:30:05,834 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:30:05,835 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:30:05,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-05-12 13:30:05,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:30:05,980 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:30:05,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 13:30:07,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:30:07,290 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:30:07,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 13:30:07,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4432bfa/e92159e230d44867a1a862fd256d1d83/FLAGacb4ade8e [2024-05-12 13:30:07,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4432bfa/e92159e230d44867a1a862fd256d1d83 [2024-05-12 13:30:07,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:30:07,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:30:07,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:30:07,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:30:07,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:30:07,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:30:05" (1/2) ... [2024-05-12 13:30:07,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a97923 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:30:07, skipping insertion in model container [2024-05-12 13:30:07,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:30:05" (1/2) ... [2024-05-12 13:30:07,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@173028b6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:30:07, skipping insertion in model container [2024-05-12 13:30:07,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:30:07" (2/2) ... [2024-05-12 13:30:07,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a97923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:07, skipping insertion in model container [2024-05-12 13:30:07,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:30:07" (2/2) ... [2024-05-12 13:30:07,342 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:30:07,392 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:30:07,393 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) [2024-05-12 13:30:07,393 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] (((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) [2024-05-12 13:30:07,393 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:30:07,393 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-05-12 13:30:07,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:30:07,666 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-05-12 13:30:07,893 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:30:07,909 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:30:07,936 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:30:08,011 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:30:08,043 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:30:08,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08 WrapperNode [2024-05-12 13:30:08,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:30:08,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:30:08,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:30:08,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:30:08,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,108 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2024-05-12 13:30:08,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:30:08,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:30:08,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:30:08,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:30:08,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,148 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 13:30:08,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:30:08,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:30:08,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:30:08,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:30:08,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (1/1) ... [2024-05-12 13:30:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:30:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:30:08,203 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-05-12 13:30:08,221 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-05-12 13:30:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:30:08,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:30:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:30:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:30:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:30:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:30:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:30:08,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:30:08,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:30:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:30:08,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:30:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:30:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:30:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:30:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:30:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:30:08,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:30:08,234 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:30:08,327 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:30:08,329 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:30:08,656 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:30:08,656 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:30:08,791 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:30:08,791 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:30:08,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:30:08 BoogieIcfgContainer [2024-05-12 13:30:08,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:30:08,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:30:08,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:30:08,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:30:08,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:30:05" (1/4) ... [2024-05-12 13:30:08,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a14eafe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:30:08, skipping insertion in model container [2024-05-12 13:30:08,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:30:07" (2/4) ... [2024-05-12 13:30:08,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a14eafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:30:08, skipping insertion in model container [2024-05-12 13:30:08,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:30:08" (3/4) ... [2024-05-12 13:30:08,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a14eafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:30:08, skipping insertion in model container [2024-05-12 13:30:08,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:30:08" (4/4) ... [2024-05-12 13:30:08,803 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 13:30:08,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:30:08,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 13:30:08,829 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:30:08,855 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:30:08,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 86 flow [2024-05-12 13:30:08,904 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-05-12 13:30:08,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:30:08,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-05-12 13:30:08,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 86 flow [2024-05-12 13:30:08,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 80 flow [2024-05-12 13:30:08,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:30:08,934 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;@3c62e96e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:30:08,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 13:30:08,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:30:08,939 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:30:08,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:30:08,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:08,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:30:08,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:08,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1075860029, now seen corresponding path program 1 times [2024-05-12 13:30:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:08,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782152612] [2024-05-12 13:30:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782152612] [2024-05-12 13:30:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782152612] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:30:09,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371505720] [2024-05-12 13:30:09,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:09,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:30:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:30:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:30:09,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-05-12 13:30:09,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:09,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:09,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-05-12 13:30:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:10,041 INFO L124 PetriNetUnfolderBase]: 384/724 cut-off events. [2024-05-12 13:30:10,042 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 13:30:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 724 events. 384/724 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3806 event pairs, 160 based on Foata normal form. 36/705 useless extension candidates. Maximal degree in co-relation 1376. Up to 639 conditions per place. [2024-05-12 13:30:10,051 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 31 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-05-12 13:30:10,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 173 flow [2024-05-12 13:30:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:30:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:30:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-05-12 13:30:10,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-05-12 13:30:10,064 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 80 flow. Second operand 3 states and 81 transitions. [2024-05-12 13:30:10,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 173 flow [2024-05-12 13:30:10,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:30:10,070 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 104 flow [2024-05-12 13:30:10,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-05-12 13:30:10,076 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-05-12 13:30:10,077 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 104 flow [2024-05-12 13:30:10,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:10,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:10,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:10,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:30:10,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:10,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:10,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1184663686, now seen corresponding path program 1 times [2024-05-12 13:30:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185076202] [2024-05-12 13:30:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:10,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185076202] [2024-05-12 13:30:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185076202] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:30:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716394723] [2024-05-12 13:30:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:10,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:30:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:30:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:30:10,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-05-12 13:30:10,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:10,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:10,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-05-12 13:30:10,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:10,734 INFO L124 PetriNetUnfolderBase]: 492/978 cut-off events. [2024-05-12 13:30:10,734 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-05-12 13:30:10,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 978 events. 492/978 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5504 event pairs, 260 based on Foata normal form. 4/909 useless extension candidates. Maximal degree in co-relation 1998. Up to 779 conditions per place. [2024-05-12 13:30:10,739 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 42 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2024-05-12 13:30:10,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 250 flow [2024-05-12 13:30:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:30:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:30:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-05-12 13:30:10,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2024-05-12 13:30:10,741 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 104 flow. Second operand 4 states and 99 transitions. [2024-05-12 13:30:10,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 250 flow [2024-05-12 13:30:10,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:30:10,743 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 138 flow [2024-05-12 13:30:10,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-05-12 13:30:10,744 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-05-12 13:30:10,744 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 138 flow [2024-05-12 13:30:10,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:10,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:10,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:10,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:30:10,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:10,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1900507362, now seen corresponding path program 1 times [2024-05-12 13:30:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759271150] [2024-05-12 13:30:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:10,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759271150] [2024-05-12 13:30:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759271150] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:10,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:30:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683540804] [2024-05-12 13:30:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:10,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:30:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:30:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:30:10,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 39 [2024-05-12 13:30:10,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:10,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:10,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 39 [2024-05-12 13:30:10,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:10,865 INFO L124 PetriNetUnfolderBase]: 143/372 cut-off events. [2024-05-12 13:30:10,865 INFO L125 PetriNetUnfolderBase]: For 109/116 co-relation queries the response was YES. [2024-05-12 13:30:10,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 372 events. 143/372 cut-off events. For 109/116 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2055 event pairs, 67 based on Foata normal form. 6/349 useless extension candidates. Maximal degree in co-relation 728. Up to 211 conditions per place. [2024-05-12 13:30:10,867 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 22 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-05-12 13:30:10,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 185 flow [2024-05-12 13:30:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:30:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:30:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-05-12 13:30:10,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7264957264957265 [2024-05-12 13:30:10,868 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 138 flow. Second operand 3 states and 85 transitions. [2024-05-12 13:30:10,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 185 flow [2024-05-12 13:30:10,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 13:30:10,870 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 118 flow [2024-05-12 13:30:10,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-05-12 13:30:10,871 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-05-12 13:30:10,871 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 118 flow [2024-05-12 13:30:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:10,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:10,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:10,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:30:10,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:10,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1026442628, now seen corresponding path program 1 times [2024-05-12 13:30:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479935161] [2024-05-12 13:30:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479935161] [2024-05-12 13:30:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479935161] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:11,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:11,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:30:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066862011] [2024-05-12 13:30:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:30:11,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:30:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:30:11,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-05-12 13:30:11,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:11,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:11,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-05-12 13:30:11,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:11,757 INFO L124 PetriNetUnfolderBase]: 373/753 cut-off events. [2024-05-12 13:30:11,757 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2024-05-12 13:30:11,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 753 events. 373/753 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4072 event pairs, 207 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 1645. Up to 613 conditions per place. [2024-05-12 13:30:11,760 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 36 selfloop transitions, 7 changer transitions 2/56 dead transitions. [2024-05-12 13:30:11,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 254 flow [2024-05-12 13:30:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:30:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:30:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-05-12 13:30:11,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2024-05-12 13:30:11,762 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 118 flow. Second operand 5 states and 107 transitions. [2024-05-12 13:30:11,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 254 flow [2024-05-12 13:30:11,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:30:11,763 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 159 flow [2024-05-12 13:30:11,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-05-12 13:30:11,764 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-05-12 13:30:11,764 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 159 flow [2024-05-12 13:30:11,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:11,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:11,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:11,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:30:11,765 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:11,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1378687194, now seen corresponding path program 1 times [2024-05-12 13:30:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361852854] [2024-05-12 13:30:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361852854] [2024-05-12 13:30:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361852854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:30:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950874425] [2024-05-12 13:30:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:12,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:30:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:30:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:30:12,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-05-12 13:30:12,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:12,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:12,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-05-12 13:30:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:12,744 INFO L124 PetriNetUnfolderBase]: 367/739 cut-off events. [2024-05-12 13:30:12,744 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2024-05-12 13:30:12,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 739 events. 367/739 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3935 event pairs, 65 based on Foata normal form. 4/710 useless extension candidates. Maximal degree in co-relation 1755. Up to 551 conditions per place. [2024-05-12 13:30:12,747 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 49 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2024-05-12 13:30:12,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 339 flow [2024-05-12 13:30:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:30:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:30:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-05-12 13:30:12,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-05-12 13:30:12,749 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 159 flow. Second operand 6 states and 129 transitions. [2024-05-12 13:30:12,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 339 flow [2024-05-12 13:30:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 13:30:12,751 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 180 flow [2024-05-12 13:30:12,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-05-12 13:30:12,752 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2024-05-12 13:30:12,752 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 180 flow [2024-05-12 13:30:12,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:12,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:12,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:12,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:30:12,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:12,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1717414646, now seen corresponding path program 1 times [2024-05-12 13:30:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:12,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936416362] [2024-05-12 13:30:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:13,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936416362] [2024-05-12 13:30:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936416362] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:13,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:13,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:30:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855475986] [2024-05-12 13:30:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:13,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:30:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:30:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:30:13,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:13,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:13,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:13,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:13,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:13,551 INFO L124 PetriNetUnfolderBase]: 491/985 cut-off events. [2024-05-12 13:30:13,551 INFO L125 PetriNetUnfolderBase]: For 930/930 co-relation queries the response was YES. [2024-05-12 13:30:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 985 events. 491/985 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5549 event pairs, 143 based on Foata normal form. 3/947 useless extension candidates. Maximal degree in co-relation 2432. Up to 691 conditions per place. [2024-05-12 13:30:13,557 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 49 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2024-05-12 13:30:13,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 400 flow [2024-05-12 13:30:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:30:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:30:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-05-12 13:30:13,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170940170940171 [2024-05-12 13:30:13,559 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 180 flow. Second operand 6 states and 121 transitions. [2024-05-12 13:30:13,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 400 flow [2024-05-12 13:30:13,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 378 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:30:13,562 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 258 flow [2024-05-12 13:30:13,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-05-12 13:30:13,562 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-05-12 13:30:13,563 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 258 flow [2024-05-12 13:30:13,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:13,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:13,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:13,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:30:13,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:13,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1718844279, now seen corresponding path program 1 times [2024-05-12 13:30:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249347516] [2024-05-12 13:30:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249347516] [2024-05-12 13:30:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249347516] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:30:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853243783] [2024-05-12 13:30:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:14,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:30:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:14,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:30:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:30:14,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:14,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:14,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:14,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:14,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:14,384 INFO L124 PetriNetUnfolderBase]: 522/1009 cut-off events. [2024-05-12 13:30:14,385 INFO L125 PetriNetUnfolderBase]: For 1534/1534 co-relation queries the response was YES. [2024-05-12 13:30:14,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 1009 events. 522/1009 cut-off events. For 1534/1534 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5643 event pairs, 169 based on Foata normal form. 2/982 useless extension candidates. Maximal degree in co-relation 2961. Up to 820 conditions per place. [2024-05-12 13:30:14,390 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 56 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-05-12 13:30:14,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 495 flow [2024-05-12 13:30:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 13:30:14,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2024-05-12 13:30:14,391 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 258 flow. Second operand 7 states and 135 transitions. [2024-05-12 13:30:14,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 495 flow [2024-05-12 13:30:14,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 487 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 13:30:14,395 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 342 flow [2024-05-12 13:30:14,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-05-12 13:30:14,396 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2024-05-12 13:30:14,396 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 342 flow [2024-05-12 13:30:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:14,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:14,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:14,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:30:14,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:14,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1693541495, now seen corresponding path program 2 times [2024-05-12 13:30:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343967614] [2024-05-12 13:30:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:14,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:14,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343967614] [2024-05-12 13:30:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343967614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:30:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136408323] [2024-05-12 13:30:14,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:14,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:30:14,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:30:14,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:30:14,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:14,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:14,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:15,241 INFO L124 PetriNetUnfolderBase]: 544/1059 cut-off events. [2024-05-12 13:30:15,241 INFO L125 PetriNetUnfolderBase]: For 2203/2203 co-relation queries the response was YES. [2024-05-12 13:30:15,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 1059 events. 544/1059 cut-off events. For 2203/2203 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6027 event pairs, 162 based on Foata normal form. 2/1030 useless extension candidates. Maximal degree in co-relation 3309. Up to 834 conditions per place. [2024-05-12 13:30:15,247 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 55 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2024-05-12 13:30:15,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 553 flow [2024-05-12 13:30:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:30:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:30:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-05-12 13:30:15,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 13:30:15,249 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 342 flow. Second operand 6 states and 117 transitions. [2024-05-12 13:30:15,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 553 flow [2024-05-12 13:30:15,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 520 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 13:30:15,253 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 370 flow [2024-05-12 13:30:15,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-05-12 13:30:15,253 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-05-12 13:30:15,253 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 370 flow [2024-05-12 13:30:15,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:15,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:15,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:15,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:30:15,254 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:15,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1700237495, now seen corresponding path program 3 times [2024-05-12 13:30:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455707515] [2024-05-12 13:30:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:15,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-05-12 13:30:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455707515] [2024-05-12 13:30:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455707515] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:15,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:15,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:30:15,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136952475] [2024-05-12 13:30:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:15,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:30:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:30:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:30:15,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:15,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:15,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:15,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:15,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:16,105 INFO L124 PetriNetUnfolderBase]: 534/1091 cut-off events. [2024-05-12 13:30:16,105 INFO L125 PetriNetUnfolderBase]: For 2572/2572 co-relation queries the response was YES. [2024-05-12 13:30:16,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1091 events. 534/1091 cut-off events. For 2572/2572 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6265 event pairs, 153 based on Foata normal form. 4/1049 useless extension candidates. Maximal degree in co-relation 3372. Up to 702 conditions per place. [2024-05-12 13:30:16,110 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 52 selfloop transitions, 19 changer transitions 0/80 dead transitions. [2024-05-12 13:30:16,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 570 flow [2024-05-12 13:30:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:30:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:30:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-05-12 13:30:16,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-05-12 13:30:16,112 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 370 flow. Second operand 6 states and 120 transitions. [2024-05-12 13:30:16,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 80 transitions, 570 flow [2024-05-12 13:30:16,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 534 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 13:30:16,115 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 379 flow [2024-05-12 13:30:16,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-05-12 13:30:16,116 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-05-12 13:30:16,116 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 379 flow [2024-05-12 13:30:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:16,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:16,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:30:16,117 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:16,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1700247415, now seen corresponding path program 1 times [2024-05-12 13:30:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:16,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427907920] [2024-05-12 13:30:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427907920] [2024-05-12 13:30:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427907920] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:16,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:30:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720457753] [2024-05-12 13:30:16,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:16,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:30:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:30:16,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:30:16,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:16,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 379 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:16,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:16,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:16,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:16,921 INFO L124 PetriNetUnfolderBase]: 573/1106 cut-off events. [2024-05-12 13:30:16,921 INFO L125 PetriNetUnfolderBase]: For 2505/2505 co-relation queries the response was YES. [2024-05-12 13:30:16,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1106 events. 573/1106 cut-off events. For 2505/2505 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6332 event pairs, 152 based on Foata normal form. 3/1074 useless extension candidates. Maximal degree in co-relation 3525. Up to 687 conditions per place. [2024-05-12 13:30:16,927 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 58 selfloop transitions, 25 changer transitions 0/92 dead transitions. [2024-05-12 13:30:16,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 92 transitions, 663 flow [2024-05-12 13:30:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-05-12 13:30:16,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201465201465202 [2024-05-12 13:30:16,929 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 379 flow. Second operand 7 states and 142 transitions. [2024-05-12 13:30:16,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 92 transitions, 663 flow [2024-05-12 13:30:16,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 612 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:16,933 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 414 flow [2024-05-12 13:30:16,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-05-12 13:30:16,935 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2024-05-12 13:30:16,935 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 414 flow [2024-05-12 13:30:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:16,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:16,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:16,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:30:16,936 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:16,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1168063285, now seen corresponding path program 1 times [2024-05-12 13:30:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618924491] [2024-05-12 13:30:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:17,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-05-12 13:30:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618924491] [2024-05-12 13:30:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618924491] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681325936] [2024-05-12 13:30:17,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:17,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:17,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:17,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:17,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:17,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:17,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:17,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:17,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:18,020 INFO L124 PetriNetUnfolderBase]: 612/1161 cut-off events. [2024-05-12 13:30:18,020 INFO L125 PetriNetUnfolderBase]: For 2872/2872 co-relation queries the response was YES. [2024-05-12 13:30:18,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3923 conditions, 1161 events. 612/1161 cut-off events. For 2872/2872 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6701 event pairs, 169 based on Foata normal form. 3/1129 useless extension candidates. Maximal degree in co-relation 3891. Up to 670 conditions per place. [2024-05-12 13:30:18,027 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 65 selfloop transitions, 29 changer transitions 0/103 dead transitions. [2024-05-12 13:30:18,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 748 flow [2024-05-12 13:30:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-05-12 13:30:18,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224358974358975 [2024-05-12 13:30:18,029 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 414 flow. Second operand 8 states and 163 transitions. [2024-05-12 13:30:18,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 748 flow [2024-05-12 13:30:18,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 720 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 13:30:18,034 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 486 flow [2024-05-12 13:30:18,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-05-12 13:30:18,034 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2024-05-12 13:30:18,035 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 486 flow [2024-05-12 13:30:18,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:18,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:18,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:30:18,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:18,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash -868492402, now seen corresponding path program 1 times [2024-05-12 13:30:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:18,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331221660] [2024-05-12 13:30:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331221660] [2024-05-12 13:30:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331221660] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:30:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071883748] [2024-05-12 13:30:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:30:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:30:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:30:18,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:18,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 486 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:18,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:18,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:18,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:19,254 INFO L124 PetriNetUnfolderBase]: 633/1246 cut-off events. [2024-05-12 13:30:19,254 INFO L125 PetriNetUnfolderBase]: For 3889/3889 co-relation queries the response was YES. [2024-05-12 13:30:19,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4421 conditions, 1246 events. 633/1246 cut-off events. For 3889/3889 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7465 event pairs, 193 based on Foata normal form. 1/1206 useless extension candidates. Maximal degree in co-relation 4387. Up to 980 conditions per place. [2024-05-12 13:30:19,261 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 69 selfloop transitions, 25 changer transitions 0/103 dead transitions. [2024-05-12 13:30:19,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 837 flow [2024-05-12 13:30:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-05-12 13:30:19,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2024-05-12 13:30:19,263 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 486 flow. Second operand 8 states and 147 transitions. [2024-05-12 13:30:19,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 837 flow [2024-05-12 13:30:19,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 103 transitions, 797 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 13:30:19,273 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 662 flow [2024-05-12 13:30:19,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=662, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2024-05-12 13:30:19,274 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2024-05-12 13:30:19,274 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 662 flow [2024-05-12 13:30:19,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:19,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:19,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:19,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:30:19,275 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:19,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1863719082, now seen corresponding path program 2 times [2024-05-12 13:30:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069327646] [2024-05-12 13:30:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069327646] [2024-05-12 13:30:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069327646] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:30:20,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435387016] [2024-05-12 13:30:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:20,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:30:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:30:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:30:20,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:20,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 662 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:20,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:20,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:20,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:20,549 INFO L124 PetriNetUnfolderBase]: 664/1339 cut-off events. [2024-05-12 13:30:20,550 INFO L125 PetriNetUnfolderBase]: For 4711/4711 co-relation queries the response was YES. [2024-05-12 13:30:20,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 1339 events. 664/1339 cut-off events. For 4711/4711 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8200 event pairs, 180 based on Foata normal form. 1/1293 useless extension candidates. Maximal degree in co-relation 4853. Up to 999 conditions per place. [2024-05-12 13:30:20,558 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 86 selfloop transitions, 35 changer transitions 0/130 dead transitions. [2024-05-12 13:30:20,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 130 transitions, 1105 flow [2024-05-12 13:30:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-05-12 13:30:20,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2024-05-12 13:30:20,560 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 662 flow. Second operand 8 states and 158 transitions. [2024-05-12 13:30:20,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 130 transitions, 1105 flow [2024-05-12 13:30:20,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 130 transitions, 1063 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-05-12 13:30:20,566 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 832 flow [2024-05-12 13:30:20,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=832, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2024-05-12 13:30:20,567 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-05-12 13:30:20,567 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 832 flow [2024-05-12 13:30:20,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:20,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:20,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:20,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:30:20,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:20,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1850212566, now seen corresponding path program 1 times [2024-05-12 13:30:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925328493] [2024-05-12 13:30:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:21,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925328493] [2024-05-12 13:30:21,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925328493] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:21,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:21,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:21,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795002955] [2024-05-12 13:30:21,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:21,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:21,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:21,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 832 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:21,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:21,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:21,578 INFO L124 PetriNetUnfolderBase]: 686/1328 cut-off events. [2024-05-12 13:30:21,579 INFO L125 PetriNetUnfolderBase]: For 5879/5879 co-relation queries the response was YES. [2024-05-12 13:30:21,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 1328 events. 686/1328 cut-off events. For 5879/5879 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7884 event pairs, 113 based on Foata normal form. 2/1288 useless extension candidates. Maximal degree in co-relation 5200. Up to 843 conditions per place. [2024-05-12 13:30:21,587 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 92 selfloop transitions, 31 changer transitions 0/132 dead transitions. [2024-05-12 13:30:21,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 132 transitions, 1228 flow [2024-05-12 13:30:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-05-12 13:30:21,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160256410256411 [2024-05-12 13:30:21,589 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 832 flow. Second operand 8 states and 161 transitions. [2024-05-12 13:30:21,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 132 transitions, 1228 flow [2024-05-12 13:30:21,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 1153 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:21,598 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 838 flow [2024-05-12 13:30:21,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=838, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2024-05-12 13:30:21,599 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2024-05-12 13:30:21,599 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 838 flow [2024-05-12 13:30:21,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:21,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:21,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:21,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 13:30:21,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:21,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1849886136, now seen corresponding path program 2 times [2024-05-12 13:30:21,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:21,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9916279] [2024-05-12 13:30:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9916279] [2024-05-12 13:30:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9916279] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:30:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808223044] [2024-05-12 13:30:22,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:22,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:30:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:30:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:30:22,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:22,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 838 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:22,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:22,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:22,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:22,575 INFO L124 PetriNetUnfolderBase]: 682/1330 cut-off events. [2024-05-12 13:30:22,575 INFO L125 PetriNetUnfolderBase]: For 6258/6258 co-relation queries the response was YES. [2024-05-12 13:30:22,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 1330 events. 682/1330 cut-off events. For 6258/6258 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7916 event pairs, 118 based on Foata normal form. 2/1290 useless extension candidates. Maximal degree in co-relation 5277. Up to 840 conditions per place. [2024-05-12 13:30:22,588 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 87 selfloop transitions, 29 changer transitions 0/125 dead transitions. [2024-05-12 13:30:22,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 125 transitions, 1158 flow [2024-05-12 13:30:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-05-12 13:30:22,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2024-05-12 13:30:22,589 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 838 flow. Second operand 7 states and 141 transitions. [2024-05-12 13:30:22,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 125 transitions, 1158 flow [2024-05-12 13:30:22,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 1090 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 13:30:22,602 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 833 flow [2024-05-12 13:30:22,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=833, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2024-05-12 13:30:22,603 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2024-05-12 13:30:22,603 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 833 flow [2024-05-12 13:30:22,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:22,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:22,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:22,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 13:30:22,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:22,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1757826986, now seen corresponding path program 3 times [2024-05-12 13:30:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536652967] [2024-05-12 13:30:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536652967] [2024-05-12 13:30:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536652967] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:23,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:30:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573068823] [2024-05-12 13:30:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:30:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:30:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:30:23,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:23,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 833 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:23,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:23,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:23,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:23,728 INFO L124 PetriNetUnfolderBase]: 702/1391 cut-off events. [2024-05-12 13:30:23,728 INFO L125 PetriNetUnfolderBase]: For 6456/6456 co-relation queries the response was YES. [2024-05-12 13:30:23,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 1391 events. 702/1391 cut-off events. For 6456/6456 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8512 event pairs, 201 based on Foata normal form. 1/1346 useless extension candidates. Maximal degree in co-relation 5433. Up to 1069 conditions per place. [2024-05-12 13:30:23,737 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 87 selfloop transitions, 42 changer transitions 0/138 dead transitions. [2024-05-12 13:30:23,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 138 transitions, 1271 flow [2024-05-12 13:30:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-05-12 13:30:23,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2024-05-12 13:30:23,738 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 833 flow. Second operand 8 states and 154 transitions. [2024-05-12 13:30:23,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 138 transitions, 1271 flow [2024-05-12 13:30:23,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 138 transitions, 1200 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 13:30:23,748 INFO L231 Difference]: Finished difference. Result has 98 places, 116 transitions, 990 flow [2024-05-12 13:30:23,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=990, PETRI_PLACES=98, PETRI_TRANSITIONS=116} [2024-05-12 13:30:23,748 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-05-12 13:30:23,748 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 116 transitions, 990 flow [2024-05-12 13:30:23,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:23,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:23,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:23,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 13:30:23,749 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:23,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1850224470, now seen corresponding path program 1 times [2024-05-12 13:30:23,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:23,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325950032] [2024-05-12 13:30:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325950032] [2024-05-12 13:30:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325950032] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:24,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:24,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955703283] [2024-05-12 13:30:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:24,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:24,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 116 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:24,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:24,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:24,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:25,136 INFO L124 PetriNetUnfolderBase]: 725/1428 cut-off events. [2024-05-12 13:30:25,137 INFO L125 PetriNetUnfolderBase]: For 7143/7143 co-relation queries the response was YES. [2024-05-12 13:30:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5689 conditions, 1428 events. 725/1428 cut-off events. For 7143/7143 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8613 event pairs, 144 based on Foata normal form. 3/1383 useless extension candidates. Maximal degree in co-relation 5642. Up to 786 conditions per place. [2024-05-12 13:30:25,146 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 108 selfloop transitions, 38 changer transitions 0/155 dead transitions. [2024-05-12 13:30:25,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 155 transitions, 1478 flow [2024-05-12 13:30:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:30:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:30:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-05-12 13:30:25,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2024-05-12 13:30:25,148 INFO L175 Difference]: Start difference. First operand has 98 places, 116 transitions, 990 flow. Second operand 9 states and 183 transitions. [2024-05-12 13:30:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 155 transitions, 1478 flow [2024-05-12 13:30:25,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 155 transitions, 1423 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 13:30:25,160 INFO L231 Difference]: Finished difference. Result has 104 places, 120 transitions, 1060 flow [2024-05-12 13:30:25,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1060, PETRI_PLACES=104, PETRI_TRANSITIONS=120} [2024-05-12 13:30:25,161 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-05-12 13:30:25,161 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 120 transitions, 1060 flow [2024-05-12 13:30:25,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:25,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:25,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:25,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 13:30:25,162 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:25,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -817544924, now seen corresponding path program 1 times [2024-05-12 13:30:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365388863] [2024-05-12 13:30:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365388863] [2024-05-12 13:30:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365388863] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:30:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239164864] [2024-05-12 13:30:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:25,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:30:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:30:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:30:25,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:25,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 120 transitions, 1060 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:25,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:25,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:25,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:26,209 INFO L124 PetriNetUnfolderBase]: 732/1398 cut-off events. [2024-05-12 13:30:26,210 INFO L125 PetriNetUnfolderBase]: For 8003/8003 co-relation queries the response was YES. [2024-05-12 13:30:26,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 1398 events. 732/1398 cut-off events. For 8003/8003 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8421 event pairs, 160 based on Foata normal form. 1/1349 useless extension candidates. Maximal degree in co-relation 6042. Up to 906 conditions per place. [2024-05-12 13:30:26,220 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 79 selfloop transitions, 55 changer transitions 0/143 dead transitions. [2024-05-12 13:30:26,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 143 transitions, 1464 flow [2024-05-12 13:30:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:30:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:30:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-05-12 13:30:26,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170940170940171 [2024-05-12 13:30:26,221 INFO L175 Difference]: Start difference. First operand has 104 places, 120 transitions, 1060 flow. Second operand 6 states and 121 transitions. [2024-05-12 13:30:26,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 143 transitions, 1464 flow [2024-05-12 13:30:26,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1367 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-05-12 13:30:26,238 INFO L231 Difference]: Finished difference. Result has 104 places, 126 transitions, 1202 flow [2024-05-12 13:30:26,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1202, PETRI_PLACES=104, PETRI_TRANSITIONS=126} [2024-05-12 13:30:26,239 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-05-12 13:30:26,239 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 126 transitions, 1202 flow [2024-05-12 13:30:26,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:26,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:26,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:26,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 13:30:26,240 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:26,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1522015670, now seen corresponding path program 1 times [2024-05-12 13:30:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943635716] [2024-05-12 13:30:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:26,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:26,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943635716] [2024-05-12 13:30:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943635716] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604328726] [2024-05-12 13:30:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:26,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:26,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:26,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:26,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:26,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 126 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:26,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:26,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:26,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:27,404 INFO L124 PetriNetUnfolderBase]: 780/1526 cut-off events. [2024-05-12 13:30:27,404 INFO L125 PetriNetUnfolderBase]: For 9813/9813 co-relation queries the response was YES. [2024-05-12 13:30:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 1526 events. 780/1526 cut-off events. For 9813/9813 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9287 event pairs, 151 based on Foata normal form. 2/1476 useless extension candidates. Maximal degree in co-relation 6601. Up to 870 conditions per place. [2024-05-12 13:30:27,414 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 120 selfloop transitions, 38 changer transitions 0/167 dead transitions. [2024-05-12 13:30:27,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 167 transitions, 1760 flow [2024-05-12 13:30:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:30:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:30:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-05-12 13:30:27,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242165242165242 [2024-05-12 13:30:27,415 INFO L175 Difference]: Start difference. First operand has 104 places, 126 transitions, 1202 flow. Second operand 9 states and 184 transitions. [2024-05-12 13:30:27,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 167 transitions, 1760 flow [2024-05-12 13:30:27,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 1719 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 13:30:27,431 INFO L231 Difference]: Finished difference. Result has 111 places, 130 transitions, 1270 flow [2024-05-12 13:30:27,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1270, PETRI_PLACES=111, PETRI_TRANSITIONS=130} [2024-05-12 13:30:27,432 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2024-05-12 13:30:27,432 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 130 transitions, 1270 flow [2024-05-12 13:30:27,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:27,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:27,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:27,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 13:30:27,433 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:27,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:27,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1511896340, now seen corresponding path program 2 times [2024-05-12 13:30:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713584759] [2024-05-12 13:30:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:27,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713584759] [2024-05-12 13:30:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713584759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432357331] [2024-05-12 13:30:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:28,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:28,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:28,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:28,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:28,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 130 transitions, 1270 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:28,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:28,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:28,440 INFO L124 PetriNetUnfolderBase]: 776/1532 cut-off events. [2024-05-12 13:30:28,441 INFO L125 PetriNetUnfolderBase]: For 10353/10353 co-relation queries the response was YES. [2024-05-12 13:30:28,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 1532 events. 776/1532 cut-off events. For 10353/10353 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9379 event pairs, 164 based on Foata normal form. 2/1481 useless extension candidates. Maximal degree in co-relation 6810. Up to 867 conditions per place. [2024-05-12 13:30:28,465 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 115 selfloop transitions, 36 changer transitions 0/160 dead transitions. [2024-05-12 13:30:28,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 160 transitions, 1728 flow [2024-05-12 13:30:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-05-12 13:30:28,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224358974358975 [2024-05-12 13:30:28,468 INFO L175 Difference]: Start difference. First operand has 111 places, 130 transitions, 1270 flow. Second operand 8 states and 163 transitions. [2024-05-12 13:30:28,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 160 transitions, 1728 flow [2024-05-12 13:30:28,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 160 transitions, 1644 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 13:30:28,485 INFO L231 Difference]: Finished difference. Result has 113 places, 130 transitions, 1263 flow [2024-05-12 13:30:28,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1263, PETRI_PLACES=113, PETRI_TRANSITIONS=130} [2024-05-12 13:30:28,485 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-05-12 13:30:28,485 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 1263 flow [2024-05-12 13:30:28,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:28,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:28,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:28,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 13:30:28,487 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:28,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1559861592, now seen corresponding path program 3 times [2024-05-12 13:30:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005248933] [2024-05-12 13:30:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:29,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005248933] [2024-05-12 13:30:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005248933] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:29,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289776578] [2024-05-12 13:30:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:29,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:29,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:29,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 130 transitions, 1263 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:29,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:29,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:29,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:29,656 INFO L124 PetriNetUnfolderBase]: 772/1526 cut-off events. [2024-05-12 13:30:29,657 INFO L125 PetriNetUnfolderBase]: For 10244/10244 co-relation queries the response was YES. [2024-05-12 13:30:29,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6800 conditions, 1526 events. 772/1526 cut-off events. For 10244/10244 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9336 event pairs, 163 based on Foata normal form. 2/1472 useless extension candidates. Maximal degree in co-relation 6747. Up to 864 conditions per place. [2024-05-12 13:30:29,697 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 118 selfloop transitions, 38 changer transitions 0/165 dead transitions. [2024-05-12 13:30:29,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 165 transitions, 1721 flow [2024-05-12 13:30:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:30:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:30:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-05-12 13:30:29,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156695156695157 [2024-05-12 13:30:29,700 INFO L175 Difference]: Start difference. First operand has 113 places, 130 transitions, 1263 flow. Second operand 9 states and 181 transitions. [2024-05-12 13:30:29,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 165 transitions, 1721 flow [2024-05-12 13:30:29,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 165 transitions, 1631 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 13:30:29,727 INFO L231 Difference]: Finished difference. Result has 115 places, 130 transitions, 1254 flow [2024-05-12 13:30:29,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1254, PETRI_PLACES=115, PETRI_TRANSITIONS=130} [2024-05-12 13:30:29,728 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-05-12 13:30:29,744 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 130 transitions, 1254 flow [2024-05-12 13:30:29,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:29,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:29,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:29,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 13:30:29,745 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:29,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1522384756, now seen corresponding path program 1 times [2024-05-12 13:30:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410719941] [2024-05-12 13:30:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:30,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410719941] [2024-05-12 13:30:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410719941] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515260058] [2024-05-12 13:30:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:30,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:30,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:30,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 130 transitions, 1254 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:30,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:30,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:30,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:31,276 INFO L124 PetriNetUnfolderBase]: 857/1659 cut-off events. [2024-05-12 13:30:31,276 INFO L125 PetriNetUnfolderBase]: For 12819/12819 co-relation queries the response was YES. [2024-05-12 13:30:31,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7335 conditions, 1659 events. 857/1659 cut-off events. For 12819/12819 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10232 event pairs, 167 based on Foata normal form. 14/1627 useless extension candidates. Maximal degree in co-relation 7281. Up to 800 conditions per place. [2024-05-12 13:30:31,287 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 123 selfloop transitions, 44 changer transitions 0/176 dead transitions. [2024-05-12 13:30:31,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 176 transitions, 1800 flow [2024-05-12 13:30:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-05-12 13:30:31,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2024-05-12 13:30:31,288 INFO L175 Difference]: Start difference. First operand has 115 places, 130 transitions, 1254 flow. Second operand 10 states and 205 transitions. [2024-05-12 13:30:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 176 transitions, 1800 flow [2024-05-12 13:30:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1719 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 13:30:31,306 INFO L231 Difference]: Finished difference. Result has 117 places, 132 transitions, 1292 flow [2024-05-12 13:30:31,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1292, PETRI_PLACES=117, PETRI_TRANSITIONS=132} [2024-05-12 13:30:31,307 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2024-05-12 13:30:31,307 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 132 transitions, 1292 flow [2024-05-12 13:30:31,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:31,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:31,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:31,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 13:30:31,308 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:31,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1623944614, now seen corresponding path program 1 times [2024-05-12 13:30:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927456954] [2024-05-12 13:30:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927456954] [2024-05-12 13:30:31,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927456954] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:31,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:31,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:30:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953760528] [2024-05-12 13:30:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:31,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:30:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:30:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:30:31,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-05-12 13:30:31,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 132 transitions, 1292 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:31,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:31,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-05-12 13:30:31,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:31,525 INFO L124 PetriNetUnfolderBase]: 453/1053 cut-off events. [2024-05-12 13:30:31,525 INFO L125 PetriNetUnfolderBase]: For 7168/7239 co-relation queries the response was YES. [2024-05-12 13:30:31,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 1053 events. 453/1053 cut-off events. For 7168/7239 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6503 event pairs, 77 based on Foata normal form. 69/1032 useless extension candidates. Maximal degree in co-relation 4252. Up to 333 conditions per place. [2024-05-12 13:30:31,532 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 54 selfloop transitions, 31 changer transitions 0/125 dead transitions. [2024-05-12 13:30:31,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 125 transitions, 1330 flow [2024-05-12 13:30:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:30:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:30:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-05-12 13:30:31,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-05-12 13:30:31,533 INFO L175 Difference]: Start difference. First operand has 117 places, 132 transitions, 1292 flow. Second operand 4 states and 106 transitions. [2024-05-12 13:30:31,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 125 transitions, 1330 flow [2024-05-12 13:30:31,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 1143 flow, removed 10 selfloop flow, removed 15 redundant places. [2024-05-12 13:30:31,544 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 1035 flow [2024-05-12 13:30:31,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1035, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2024-05-12 13:30:31,545 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2024-05-12 13:30:31,545 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 1035 flow [2024-05-12 13:30:31,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:31,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:31,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:31,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 13:30:31,546 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:31,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1349557067, now seen corresponding path program 1 times [2024-05-12 13:30:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525793642] [2024-05-12 13:30:31,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525793642] [2024-05-12 13:30:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525793642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:32,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99679497] [2024-05-12 13:30:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:32,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:32,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:32,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:32,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:32,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:32,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 1035 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:32,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:32,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:32,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:32,626 INFO L124 PetriNetUnfolderBase]: 574/1145 cut-off events. [2024-05-12 13:30:32,627 INFO L125 PetriNetUnfolderBase]: For 8855/8855 co-relation queries the response was YES. [2024-05-12 13:30:32,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 1145 events. 574/1145 cut-off events. For 8855/8855 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6405 event pairs, 176 based on Foata normal form. 1/1073 useless extension candidates. Maximal degree in co-relation 5054. Up to 798 conditions per place. [2024-05-12 13:30:32,633 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 65 selfloop transitions, 52 changer transitions 0/127 dead transitions. [2024-05-12 13:30:32,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 127 transitions, 1359 flow [2024-05-12 13:30:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-05-12 13:30:32,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2024-05-12 13:30:32,635 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 1035 flow. Second operand 7 states and 131 transitions. [2024-05-12 13:30:32,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 127 transitions, 1359 flow [2024-05-12 13:30:32,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 1346 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 13:30:32,651 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 1167 flow [2024-05-12 13:30:32,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1167, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2024-05-12 13:30:32,651 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2024-05-12 13:30:32,651 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 1167 flow [2024-05-12 13:30:32,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:32,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:32,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:32,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 13:30:32,652 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:32,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1034079167, now seen corresponding path program 1 times [2024-05-12 13:30:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773817599] [2024-05-12 13:30:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:33,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:33,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773817599] [2024-05-12 13:30:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773817599] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:33,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:33,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:33,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889501264] [2024-05-12 13:30:33,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:33,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:33,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:33,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:33,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:33,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 1167 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:33,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:33,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:33,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:33,769 INFO L124 PetriNetUnfolderBase]: 591/1236 cut-off events. [2024-05-12 13:30:33,769 INFO L125 PetriNetUnfolderBase]: For 9524/9524 co-relation queries the response was YES. [2024-05-12 13:30:33,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1236 events. 591/1236 cut-off events. For 9524/9524 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7053 event pairs, 155 based on Foata normal form. 2/1169 useless extension candidates. Maximal degree in co-relation 5430. Up to 913 conditions per place. [2024-05-12 13:30:33,775 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 101 selfloop transitions, 28 changer transitions 0/139 dead transitions. [2024-05-12 13:30:33,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 1521 flow [2024-05-12 13:30:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-05-12 13:30:33,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2024-05-12 13:30:33,776 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 1167 flow. Second operand 8 states and 147 transitions. [2024-05-12 13:30:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 1521 flow [2024-05-12 13:30:33,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 139 transitions, 1406 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 13:30:33,796 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 1145 flow [2024-05-12 13:30:33,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1145, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2024-05-12 13:30:33,796 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-05-12 13:30:33,797 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 1145 flow [2024-05-12 13:30:33,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:33,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:33,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:33,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 13:30:33,797 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:33,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash 31296953, now seen corresponding path program 2 times [2024-05-12 13:30:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774154934] [2024-05-12 13:30:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774154934] [2024-05-12 13:30:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774154934] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:34,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644561062] [2024-05-12 13:30:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:34,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:34,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:34,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 1145 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:34,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:34,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:34,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:34,953 INFO L124 PetriNetUnfolderBase]: 608/1276 cut-off events. [2024-05-12 13:30:34,953 INFO L125 PetriNetUnfolderBase]: For 9850/9850 co-relation queries the response was YES. [2024-05-12 13:30:34,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 1276 events. 608/1276 cut-off events. For 9850/9850 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7368 event pairs, 162 based on Foata normal form. 2/1202 useless extension candidates. Maximal degree in co-relation 5558. Up to 990 conditions per place. [2024-05-12 13:30:34,961 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 109 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2024-05-12 13:30:34,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 139 transitions, 1511 flow [2024-05-12 13:30:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 13:30:34,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-05-12 13:30:34,962 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 1145 flow. Second operand 8 states and 142 transitions. [2024-05-12 13:30:34,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 139 transitions, 1511 flow [2024-05-12 13:30:34,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 1456 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:34,982 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 1187 flow [2024-05-12 13:30:34,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1187, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2024-05-12 13:30:34,983 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-05-12 13:30:34,983 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 1187 flow [2024-05-12 13:30:34,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:34,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:34,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:34,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 13:30:34,983 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:34,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 787302277, now seen corresponding path program 3 times [2024-05-12 13:30:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911767033] [2024-05-12 13:30:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911767033] [2024-05-12 13:30:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911767033] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:35,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970447349] [2024-05-12 13:30:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:35,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:35,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:35,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 1187 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:35,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:35,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:35,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:36,024 INFO L124 PetriNetUnfolderBase]: 625/1307 cut-off events. [2024-05-12 13:30:36,024 INFO L125 PetriNetUnfolderBase]: For 10682/10682 co-relation queries the response was YES. [2024-05-12 13:30:36,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 1307 events. 625/1307 cut-off events. For 10682/10682 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7612 event pairs, 165 based on Foata normal form. 2/1231 useless extension candidates. Maximal degree in co-relation 5783. Up to 992 conditions per place. [2024-05-12 13:30:36,031 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 94 selfloop transitions, 38 changer transitions 0/142 dead transitions. [2024-05-12 13:30:36,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 142 transitions, 1539 flow [2024-05-12 13:30:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 13:30:36,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46474358974358976 [2024-05-12 13:30:36,032 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 1187 flow. Second operand 8 states and 145 transitions. [2024-05-12 13:30:36,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 142 transitions, 1539 flow [2024-05-12 13:30:36,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 142 transitions, 1486 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:36,051 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 1237 flow [2024-05-12 13:30:36,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1237, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2024-05-12 13:30:36,052 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-05-12 13:30:36,052 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 1237 flow [2024-05-12 13:30:36,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:36,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:36,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:36,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 13:30:36,052 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:36,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash -631648523, now seen corresponding path program 4 times [2024-05-12 13:30:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:36,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827946109] [2024-05-12 13:30:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:36,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:36,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827946109] [2024-05-12 13:30:36,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827946109] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:36,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:36,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836707107] [2024-05-12 13:30:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:36,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:36,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 1237 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:36,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:36,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:36,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:37,430 INFO L124 PetriNetUnfolderBase]: 643/1348 cut-off events. [2024-05-12 13:30:37,431 INFO L125 PetriNetUnfolderBase]: For 11513/11513 co-relation queries the response was YES. [2024-05-12 13:30:37,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5930 conditions, 1348 events. 643/1348 cut-off events. For 11513/11513 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7960 event pairs, 160 based on Foata normal form. 4/1266 useless extension candidates. Maximal degree in co-relation 5873. Up to 983 conditions per place. [2024-05-12 13:30:37,437 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 110 selfloop transitions, 24 changer transitions 0/144 dead transitions. [2024-05-12 13:30:37,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 144 transitions, 1626 flow [2024-05-12 13:30:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 13:30:37,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2024-05-12 13:30:37,440 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 1237 flow. Second operand 8 states and 146 transitions. [2024-05-12 13:30:37,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 144 transitions, 1626 flow [2024-05-12 13:30:37,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 144 transitions, 1543 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 13:30:37,464 INFO L231 Difference]: Finished difference. Result has 125 places, 127 transitions, 1269 flow [2024-05-12 13:30:37,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1269, PETRI_PLACES=125, PETRI_TRANSITIONS=127} [2024-05-12 13:30:37,469 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-05-12 13:30:37,470 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 127 transitions, 1269 flow [2024-05-12 13:30:37,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:37,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:37,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:37,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 13:30:37,470 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:37,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash -375852713, now seen corresponding path program 1 times [2024-05-12 13:30:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086190497] [2024-05-12 13:30:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:38,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:38,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086190497] [2024-05-12 13:30:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086190497] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:38,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945392503] [2024-05-12 13:30:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:38,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:38,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:38,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:38,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:38,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 127 transitions, 1269 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:38,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:38,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:38,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:38,605 INFO L124 PetriNetUnfolderBase]: 656/1373 cut-off events. [2024-05-12 13:30:38,606 INFO L125 PetriNetUnfolderBase]: For 11791/11791 co-relation queries the response was YES. [2024-05-12 13:30:38,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6106 conditions, 1373 events. 656/1373 cut-off events. For 11791/11791 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8130 event pairs, 165 based on Foata normal form. 2/1284 useless extension candidates. Maximal degree in co-relation 6047. Up to 939 conditions per place. [2024-05-12 13:30:38,615 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 101 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-05-12 13:30:38,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 1693 flow [2024-05-12 13:30:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:30:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:30:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 13:30:38,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672364672364672 [2024-05-12 13:30:38,617 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 1269 flow. Second operand 9 states and 164 transitions. [2024-05-12 13:30:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 1693 flow [2024-05-12 13:30:38,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 148 transitions, 1622 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:38,648 INFO L231 Difference]: Finished difference. Result has 129 places, 130 transitions, 1330 flow [2024-05-12 13:30:38,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1330, PETRI_PLACES=129, PETRI_TRANSITIONS=130} [2024-05-12 13:30:38,649 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places. [2024-05-12 13:30:38,649 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 1330 flow [2024-05-12 13:30:38,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:38,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:38,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:38,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 13:30:38,650 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:38,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash -62153483, now seen corresponding path program 2 times [2024-05-12 13:30:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848179886] [2024-05-12 13:30:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848179886] [2024-05-12 13:30:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848179886] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:39,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902175387] [2024-05-12 13:30:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:39,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:39,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:39,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:39,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:39,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 1330 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:39,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:39,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:39,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:40,071 INFO L124 PetriNetUnfolderBase]: 669/1386 cut-off events. [2024-05-12 13:30:40,071 INFO L125 PetriNetUnfolderBase]: For 12328/12328 co-relation queries the response was YES. [2024-05-12 13:30:40,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6232 conditions, 1386 events. 669/1386 cut-off events. For 12328/12328 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8160 event pairs, 156 based on Foata normal form. 2/1294 useless extension candidates. Maximal degree in co-relation 6172. Up to 958 conditions per place. [2024-05-12 13:30:40,078 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 104 selfloop transitions, 40 changer transitions 0/154 dead transitions. [2024-05-12 13:30:40,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 154 transitions, 1802 flow [2024-05-12 13:30:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:30:40,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641025641025641 [2024-05-12 13:30:40,080 INFO L175 Difference]: Start difference. First operand has 129 places, 130 transitions, 1330 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:30:40,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 154 transitions, 1802 flow [2024-05-12 13:30:40,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 154 transitions, 1700 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-05-12 13:30:40,106 INFO L231 Difference]: Finished difference. Result has 132 places, 133 transitions, 1372 flow [2024-05-12 13:30:40,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=132, PETRI_TRANSITIONS=133} [2024-05-12 13:30:40,107 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places. [2024-05-12 13:30:40,107 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 133 transitions, 1372 flow [2024-05-12 13:30:40,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:40,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:40,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 13:30:40,107 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:40,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1111068093, now seen corresponding path program 3 times [2024-05-12 13:30:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44650737] [2024-05-12 13:30:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44650737] [2024-05-12 13:30:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44650737] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:40,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166646459] [2024-05-12 13:30:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:41,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:41,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 133 transitions, 1372 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:41,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:41,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:41,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:41,376 INFO L124 PetriNetUnfolderBase]: 675/1406 cut-off events. [2024-05-12 13:30:41,376 INFO L125 PetriNetUnfolderBase]: For 12932/12932 co-relation queries the response was YES. [2024-05-12 13:30:41,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 1406 events. 675/1406 cut-off events. For 12932/12932 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8334 event pairs, 166 based on Foata normal form. 1/1313 useless extension candidates. Maximal degree in co-relation 6299. Up to 1056 conditions per place. [2024-05-12 13:30:41,384 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 122 selfloop transitions, 32 changer transitions 0/164 dead transitions. [2024-05-12 13:30:41,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 164 transitions, 1919 flow [2024-05-12 13:30:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-05-12 13:30:41,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-05-12 13:30:41,385 INFO L175 Difference]: Start difference. First operand has 132 places, 133 transitions, 1372 flow. Second operand 10 states and 174 transitions. [2024-05-12 13:30:41,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 164 transitions, 1919 flow [2024-05-12 13:30:41,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 164 transitions, 1794 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-05-12 13:30:41,414 INFO L231 Difference]: Finished difference. Result has 139 places, 146 transitions, 1528 flow [2024-05-12 13:30:41,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1528, PETRI_PLACES=139, PETRI_TRANSITIONS=146} [2024-05-12 13:30:41,414 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-05-12 13:30:41,415 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 1528 flow [2024-05-12 13:30:41,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:41,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:41,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:41,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 13:30:41,415 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:41,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1110682143, now seen corresponding path program 4 times [2024-05-12 13:30:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:41,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488780006] [2024-05-12 13:30:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:41,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488780006] [2024-05-12 13:30:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488780006] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087441749] [2024-05-12 13:30:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:42,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:42,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:42,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 1528 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:42,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:42,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:42,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:42,696 INFO L124 PetriNetUnfolderBase]: 680/1407 cut-off events. [2024-05-12 13:30:42,696 INFO L125 PetriNetUnfolderBase]: For 13592/13592 co-relation queries the response was YES. [2024-05-12 13:30:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 1407 events. 680/1407 cut-off events. For 13592/13592 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8283 event pairs, 169 based on Foata normal form. 2/1313 useless extension candidates. Maximal degree in co-relation 6391. Up to 954 conditions per place. [2024-05-12 13:30:42,704 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 105 selfloop transitions, 52 changer transitions 0/167 dead transitions. [2024-05-12 13:30:42,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 167 transitions, 1974 flow [2024-05-12 13:30:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 13:30:42,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592074592074592 [2024-05-12 13:30:42,705 INFO L175 Difference]: Start difference. First operand has 139 places, 146 transitions, 1528 flow. Second operand 11 states and 197 transitions. [2024-05-12 13:30:42,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 167 transitions, 1974 flow [2024-05-12 13:30:42,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 167 transitions, 1856 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-05-12 13:30:42,738 INFO L231 Difference]: Finished difference. Result has 147 places, 149 transitions, 1592 flow [2024-05-12 13:30:42,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1592, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2024-05-12 13:30:42,739 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-05-12 13:30:42,739 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 1592 flow [2024-05-12 13:30:42,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:42,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:42,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:42,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 13:30:42,740 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:42,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -293021549, now seen corresponding path program 1 times [2024-05-12 13:30:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:42,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774912318] [2024-05-12 13:30:42,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:43,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:43,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774912318] [2024-05-12 13:30:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774912318] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:43,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088206886] [2024-05-12 13:30:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:43,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:43,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:43,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 1592 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:43,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:43,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:43,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:43,977 INFO L124 PetriNetUnfolderBase]: 697/1442 cut-off events. [2024-05-12 13:30:43,978 INFO L125 PetriNetUnfolderBase]: For 13394/13394 co-relation queries the response was YES. [2024-05-12 13:30:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 1442 events. 697/1442 cut-off events. For 13394/13394 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8558 event pairs, 197 based on Foata normal form. 2/1343 useless extension candidates. Maximal degree in co-relation 6514. Up to 1031 conditions per place. [2024-05-12 13:30:43,986 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 104 selfloop transitions, 50 changer transitions 0/164 dead transitions. [2024-05-12 13:30:43,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 1960 flow [2024-05-12 13:30:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-05-12 13:30:43,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2024-05-12 13:30:43,987 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 1592 flow. Second operand 7 states and 131 transitions. [2024-05-12 13:30:43,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 1960 flow [2024-05-12 13:30:44,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 164 transitions, 1818 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-05-12 13:30:44,021 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 1565 flow [2024-05-12 13:30:44,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1565, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2024-05-12 13:30:44,022 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2024-05-12 13:30:44,022 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 1565 flow [2024-05-12 13:30:44,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:44,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:44,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:44,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 13:30:44,023 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:44,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1183352575, now seen corresponding path program 2 times [2024-05-12 13:30:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880142611] [2024-05-12 13:30:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:44,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880142611] [2024-05-12 13:30:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880142611] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554801266] [2024-05-12 13:30:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:44,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:44,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 1565 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:44,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:44,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:44,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:45,066 INFO L124 PetriNetUnfolderBase]: 714/1465 cut-off events. [2024-05-12 13:30:45,067 INFO L125 PetriNetUnfolderBase]: For 13069/13069 co-relation queries the response was YES. [2024-05-12 13:30:45,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6612 conditions, 1465 events. 714/1465 cut-off events. For 13069/13069 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8679 event pairs, 124 based on Foata normal form. 2/1373 useless extension candidates. Maximal degree in co-relation 6543. Up to 1094 conditions per place. [2024-05-12 13:30:45,075 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 138 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-05-12 13:30:45,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 171 transitions, 1971 flow [2024-05-12 13:30:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-05-12 13:30:45,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2024-05-12 13:30:45,077 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 1565 flow. Second operand 7 states and 131 transitions. [2024-05-12 13:30:45,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 171 transitions, 1971 flow [2024-05-12 13:30:45,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 171 transitions, 1868 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:45,113 INFO L231 Difference]: Finished difference. Result has 147 places, 151 transitions, 1524 flow [2024-05-12 13:30:45,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1524, PETRI_PLACES=147, PETRI_TRANSITIONS=151} [2024-05-12 13:30:45,113 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-05-12 13:30:45,113 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 1524 flow [2024-05-12 13:30:45,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:45,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:45,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:45,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 13:30:45,114 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:45,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1989779415, now seen corresponding path program 3 times [2024-05-12 13:30:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:45,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008425062] [2024-05-12 13:30:45,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008425062] [2024-05-12 13:30:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008425062] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:45,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986526698] [2024-05-12 13:30:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:45,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:30:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:30:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:30:45,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:45,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 1524 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:45,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:45,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:45,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:46,170 INFO L124 PetriNetUnfolderBase]: 715/1482 cut-off events. [2024-05-12 13:30:46,171 INFO L125 PetriNetUnfolderBase]: For 12760/12760 co-relation queries the response was YES. [2024-05-12 13:30:46,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 1482 events. 715/1482 cut-off events. For 12760/12760 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8898 event pairs, 198 based on Foata normal form. 2/1385 useless extension candidates. Maximal degree in co-relation 6461. Up to 904 conditions per place. [2024-05-12 13:30:46,179 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 119 selfloop transitions, 41 changer transitions 0/170 dead transitions. [2024-05-12 13:30:46,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 170 transitions, 1922 flow [2024-05-12 13:30:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:30:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:30:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-05-12 13:30:46,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-05-12 13:30:46,181 INFO L175 Difference]: Start difference. First operand has 147 places, 151 transitions, 1524 flow. Second operand 7 states and 133 transitions. [2024-05-12 13:30:46,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 170 transitions, 1922 flow [2024-05-12 13:30:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 170 transitions, 1870 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:46,217 INFO L231 Difference]: Finished difference. Result has 149 places, 152 transitions, 1574 flow [2024-05-12 13:30:46,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1574, PETRI_PLACES=149, PETRI_TRANSITIONS=152} [2024-05-12 13:30:46,218 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-05-12 13:30:46,218 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 152 transitions, 1574 flow [2024-05-12 13:30:46,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:46,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:46,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:46,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 13:30:46,219 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:46,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1093679681, now seen corresponding path program 1 times [2024-05-12 13:30:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420608789] [2024-05-12 13:30:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420608789] [2024-05-12 13:30:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420608789] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:46,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052297862] [2024-05-12 13:30:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:46,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:46,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:47,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:47,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 152 transitions, 1574 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:47,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:47,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:47,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:47,390 INFO L124 PetriNetUnfolderBase]: 733/1514 cut-off events. [2024-05-12 13:30:47,390 INFO L125 PetriNetUnfolderBase]: For 13746/13746 co-relation queries the response was YES. [2024-05-12 13:30:47,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6835 conditions, 1514 events. 733/1514 cut-off events. For 13746/13746 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9055 event pairs, 186 based on Foata normal form. 1/1408 useless extension candidates. Maximal degree in co-relation 6764. Up to 1191 conditions per place. [2024-05-12 13:30:47,399 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 121 selfloop transitions, 41 changer transitions 0/172 dead transitions. [2024-05-12 13:30:47,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 172 transitions, 2034 flow [2024-05-12 13:30:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-05-12 13:30:47,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2024-05-12 13:30:47,401 INFO L175 Difference]: Start difference. First operand has 149 places, 152 transitions, 1574 flow. Second operand 10 states and 168 transitions. [2024-05-12 13:30:47,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 172 transitions, 2034 flow [2024-05-12 13:30:47,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 172 transitions, 1942 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:47,437 INFO L231 Difference]: Finished difference. Result has 156 places, 158 transitions, 1675 flow [2024-05-12 13:30:47,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1675, PETRI_PLACES=156, PETRI_TRANSITIONS=158} [2024-05-12 13:30:47,440 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2024-05-12 13:30:47,441 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 158 transitions, 1675 flow [2024-05-12 13:30:47,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:47,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:47,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:47,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 13:30:47,441 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:47,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1233468819, now seen corresponding path program 1 times [2024-05-12 13:30:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845612133] [2024-05-12 13:30:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:48,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:48,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845612133] [2024-05-12 13:30:48,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845612133] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:48,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:48,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:48,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55596251] [2024-05-12 13:30:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:48,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:48,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:48,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 158 transitions, 1675 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:48,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:48,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:48,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:48,651 INFO L124 PetriNetUnfolderBase]: 750/1562 cut-off events. [2024-05-12 13:30:48,651 INFO L125 PetriNetUnfolderBase]: For 14614/14614 co-relation queries the response was YES. [2024-05-12 13:30:48,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 1562 events. 750/1562 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9493 event pairs, 213 based on Foata normal form. 2/1460 useless extension candidates. Maximal degree in co-relation 6909. Up to 1165 conditions per place. [2024-05-12 13:30:48,662 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 141 selfloop transitions, 33 changer transitions 0/184 dead transitions. [2024-05-12 13:30:48,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 184 transitions, 2153 flow [2024-05-12 13:30:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-05-12 13:30:48,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45384615384615384 [2024-05-12 13:30:48,664 INFO L175 Difference]: Start difference. First operand has 156 places, 158 transitions, 1675 flow. Second operand 10 states and 177 transitions. [2024-05-12 13:30:48,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 184 transitions, 2153 flow [2024-05-12 13:30:48,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 184 transitions, 2054 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:48,710 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 1705 flow [2024-05-12 13:30:48,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1705, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2024-05-12 13:30:48,711 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-05-12 13:30:48,711 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 1705 flow [2024-05-12 13:30:48,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:48,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:48,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:48,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 13:30:48,712 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:48,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash -70991321, now seen corresponding path program 2 times [2024-05-12 13:30:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:48,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001526310] [2024-05-12 13:30:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001526310] [2024-05-12 13:30:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001526310] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:49,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:49,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563431244] [2024-05-12 13:30:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:49,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:49,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:49,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:49,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:49,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 1705 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:49,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:49,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:49,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:50,354 INFO L124 PetriNetUnfolderBase]: 871/1852 cut-off events. [2024-05-12 13:30:50,354 INFO L125 PetriNetUnfolderBase]: For 21989/21989 co-relation queries the response was YES. [2024-05-12 13:30:50,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8388 conditions, 1852 events. 871/1852 cut-off events. For 21989/21989 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11928 event pairs, 254 based on Foata normal form. 2/1739 useless extension candidates. Maximal degree in co-relation 8311. Up to 878 conditions per place. [2024-05-12 13:30:50,366 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 133 selfloop transitions, 55 changer transitions 0/198 dead transitions. [2024-05-12 13:30:50,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 198 transitions, 2317 flow [2024-05-12 13:30:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:30:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:30:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-05-12 13:30:50,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-05-12 13:30:50,368 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 1705 flow. Second operand 12 states and 222 transitions. [2024-05-12 13:30:50,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 198 transitions, 2317 flow [2024-05-12 13:30:50,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 198 transitions, 2245 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 13:30:50,421 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 1781 flow [2024-05-12 13:30:50,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1781, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2024-05-12 13:30:50,422 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-05-12 13:30:50,422 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 1781 flow [2024-05-12 13:30:50,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:50,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:50,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:50,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 13:30:50,422 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:50,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -83371481, now seen corresponding path program 3 times [2024-05-12 13:30:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962154022] [2024-05-12 13:30:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962154022] [2024-05-12 13:30:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962154022] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4430749] [2024-05-12 13:30:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:51,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:51,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:51,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 1781 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:51,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:51,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:51,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:51,869 INFO L124 PetriNetUnfolderBase]: 875/1868 cut-off events. [2024-05-12 13:30:51,869 INFO L125 PetriNetUnfolderBase]: For 23646/23646 co-relation queries the response was YES. [2024-05-12 13:30:51,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8287 conditions, 1868 events. 875/1868 cut-off events. For 23646/23646 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12143 event pairs, 261 based on Foata normal form. 12/1757 useless extension candidates. Maximal degree in co-relation 8210. Up to 1162 conditions per place. [2024-05-12 13:30:51,881 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 135 selfloop transitions, 48 changer transitions 0/193 dead transitions. [2024-05-12 13:30:51,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 193 transitions, 2295 flow [2024-05-12 13:30:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 13:30:51,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47086247086247085 [2024-05-12 13:30:51,883 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 1781 flow. Second operand 11 states and 202 transitions. [2024-05-12 13:30:51,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 193 transitions, 2295 flow [2024-05-12 13:30:51,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 193 transitions, 2200 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 13:30:51,937 INFO L231 Difference]: Finished difference. Result has 174 places, 167 transitions, 1829 flow [2024-05-12 13:30:51,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1829, PETRI_PLACES=174, PETRI_TRANSITIONS=167} [2024-05-12 13:30:51,937 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places. [2024-05-12 13:30:51,938 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 167 transitions, 1829 flow [2024-05-12 13:30:51,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:51,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:51,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:51,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 13:30:51,940 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:51,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash -425670071, now seen corresponding path program 4 times [2024-05-12 13:30:51,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:51,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128957309] [2024-05-12 13:30:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:51,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:52,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128957309] [2024-05-12 13:30:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128957309] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379124998] [2024-05-12 13:30:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:52,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:52,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:52,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:52,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:53,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:53,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 167 transitions, 1829 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:53,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:53,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:53,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:53,593 INFO L124 PetriNetUnfolderBase]: 926/2007 cut-off events. [2024-05-12 13:30:53,593 INFO L125 PetriNetUnfolderBase]: For 22558/22558 co-relation queries the response was YES. [2024-05-12 13:30:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8673 conditions, 2007 events. 926/2007 cut-off events. For 22558/22558 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13429 event pairs, 289 based on Foata normal form. 10/1883 useless extension candidates. Maximal degree in co-relation 8593. Up to 1302 conditions per place. [2024-05-12 13:30:53,609 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 137 selfloop transitions, 46 changer transitions 0/193 dead transitions. [2024-05-12 13:30:53,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 193 transitions, 2315 flow [2024-05-12 13:30:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 13:30:53,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47086247086247085 [2024-05-12 13:30:53,623 INFO L175 Difference]: Start difference. First operand has 174 places, 167 transitions, 1829 flow. Second operand 11 states and 202 transitions. [2024-05-12 13:30:53,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 193 transitions, 2315 flow [2024-05-12 13:30:53,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 193 transitions, 2218 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 13:30:53,705 INFO L231 Difference]: Finished difference. Result has 177 places, 167 transitions, 1829 flow [2024-05-12 13:30:53,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1829, PETRI_PLACES=177, PETRI_TRANSITIONS=167} [2024-05-12 13:30:53,706 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-05-12 13:30:53,707 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 167 transitions, 1829 flow [2024-05-12 13:30:53,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:53,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:53,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:53,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 13:30:53,707 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:53,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash -71407031, now seen corresponding path program 5 times [2024-05-12 13:30:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820648083] [2024-05-12 13:30:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820648083] [2024-05-12 13:30:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820648083] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:54,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499342083] [2024-05-12 13:30:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:54,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:54,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:54,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:54,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:54,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 167 transitions, 1829 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:54,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:54,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:54,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:55,219 INFO L124 PetriNetUnfolderBase]: 923/2005 cut-off events. [2024-05-12 13:30:55,219 INFO L125 PetriNetUnfolderBase]: For 17628/17628 co-relation queries the response was YES. [2024-05-12 13:30:55,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 2005 events. 923/2005 cut-off events. For 17628/17628 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13447 event pairs, 288 based on Foata normal form. 2/1871 useless extension candidates. Maximal degree in co-relation 8477. Up to 1489 conditions per place. [2024-05-12 13:30:55,233 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 143 selfloop transitions, 40 changer transitions 0/193 dead transitions. [2024-05-12 13:30:55,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 2307 flow [2024-05-12 13:30:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:30:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:30:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-05-12 13:30:55,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 13:30:55,235 INFO L175 Difference]: Start difference. First operand has 177 places, 167 transitions, 1829 flow. Second operand 12 states and 208 transitions. [2024-05-12 13:30:55,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 2307 flow [2024-05-12 13:30:55,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 193 transitions, 2171 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-05-12 13:30:55,293 INFO L231 Difference]: Finished difference. Result has 180 places, 168 transitions, 1799 flow [2024-05-12 13:30:55,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1799, PETRI_PLACES=180, PETRI_TRANSITIONS=168} [2024-05-12 13:30:55,293 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places. [2024-05-12 13:30:55,293 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 168 transitions, 1799 flow [2024-05-12 13:30:55,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:55,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:55,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:55,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 13:30:55,294 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:55,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 714512401, now seen corresponding path program 2 times [2024-05-12 13:30:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782923799] [2024-05-12 13:30:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782923799] [2024-05-12 13:30:56,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782923799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:56,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:56,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:56,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020788791] [2024-05-12 13:30:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:56,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:56,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 168 transitions, 1799 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:56,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:56,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:56,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:56,585 INFO L124 PetriNetUnfolderBase]: 934/2020 cut-off events. [2024-05-12 13:30:56,586 INFO L125 PetriNetUnfolderBase]: For 17216/17216 co-relation queries the response was YES. [2024-05-12 13:30:56,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8435 conditions, 2020 events. 934/2020 cut-off events. For 17216/17216 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13489 event pairs, 283 based on Foata normal form. 2/1879 useless extension candidates. Maximal degree in co-relation 8353. Up to 1579 conditions per place. [2024-05-12 13:30:56,604 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 142 selfloop transitions, 43 changer transitions 0/195 dead transitions. [2024-05-12 13:30:56,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 195 transitions, 2343 flow [2024-05-12 13:30:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 13:30:56,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441025641025641 [2024-05-12 13:30:56,605 INFO L175 Difference]: Start difference. First operand has 180 places, 168 transitions, 1799 flow. Second operand 10 states and 172 transitions. [2024-05-12 13:30:56,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 195 transitions, 2343 flow [2024-05-12 13:30:56,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 195 transitions, 2218 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-05-12 13:30:56,667 INFO L231 Difference]: Finished difference. Result has 180 places, 175 transitions, 1892 flow [2024-05-12 13:30:56,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1892, PETRI_PLACES=180, PETRI_TRANSITIONS=175} [2024-05-12 13:30:56,668 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places. [2024-05-12 13:30:56,668 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 1892 flow [2024-05-12 13:30:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:56,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:56,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:56,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 13:30:56,669 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:56,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -493732486, now seen corresponding path program 1 times [2024-05-12 13:30:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312903571] [2024-05-12 13:30:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:57,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312903571] [2024-05-12 13:30:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312903571] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:57,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897892796] [2024-05-12 13:30:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:57,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:57,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:57,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 1892 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:57,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:57,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:57,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:57,793 INFO L124 PetriNetUnfolderBase]: 988/2140 cut-off events. [2024-05-12 13:30:57,794 INFO L125 PetriNetUnfolderBase]: For 19180/19180 co-relation queries the response was YES. [2024-05-12 13:30:57,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8704 conditions, 2140 events. 988/2140 cut-off events. For 19180/19180 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14586 event pairs, 280 based on Foata normal form. 2/1994 useless extension candidates. Maximal degree in co-relation 8621. Up to 1606 conditions per place. [2024-05-12 13:30:57,810 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 150 selfloop transitions, 41 changer transitions 0/201 dead transitions. [2024-05-12 13:30:57,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 201 transitions, 2444 flow [2024-05-12 13:30:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 13:30:57,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2024-05-12 13:30:57,812 INFO L175 Difference]: Start difference. First operand has 180 places, 175 transitions, 1892 flow. Second operand 10 states and 175 transitions. [2024-05-12 13:30:57,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 201 transitions, 2444 flow [2024-05-12 13:30:57,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 201 transitions, 2292 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-05-12 13:30:57,876 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 1852 flow [2024-05-12 13:30:57,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1852, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2024-05-12 13:30:57,877 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places. [2024-05-12 13:30:57,877 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 1852 flow [2024-05-12 13:30:57,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:57,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:57,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:57,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 13:30:57,878 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:57,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2067978272, now seen corresponding path program 2 times [2024-05-12 13:30:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:57,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766590822] [2024-05-12 13:30:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:57,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766590822] [2024-05-12 13:30:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766590822] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896768446] [2024-05-12 13:30:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:58,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:58,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:58,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:58,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 1852 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:58,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:58,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:58,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:59,088 INFO L124 PetriNetUnfolderBase]: 1002/2174 cut-off events. [2024-05-12 13:30:59,088 INFO L125 PetriNetUnfolderBase]: For 18947/18947 co-relation queries the response was YES. [2024-05-12 13:30:59,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8676 conditions, 2174 events. 1002/2174 cut-off events. For 18947/18947 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14905 event pairs, 307 based on Foata normal form. 4/2022 useless extension candidates. Maximal degree in co-relation 8591. Up to 1525 conditions per place. [2024-05-12 13:30:59,105 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 118 selfloop transitions, 68 changer transitions 0/196 dead transitions. [2024-05-12 13:30:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 196 transitions, 2299 flow [2024-05-12 13:30:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 13:30:59,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775641025641026 [2024-05-12 13:30:59,106 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 1852 flow. Second operand 8 states and 149 transitions. [2024-05-12 13:30:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 196 transitions, 2299 flow [2024-05-12 13:30:59,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 196 transitions, 2246 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 13:30:59,168 INFO L231 Difference]: Finished difference. Result has 187 places, 179 transitions, 1953 flow [2024-05-12 13:30:59,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1953, PETRI_PLACES=187, PETRI_TRANSITIONS=179} [2024-05-12 13:30:59,169 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places. [2024-05-12 13:30:59,169 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 179 transitions, 1953 flow [2024-05-12 13:30:59,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:59,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:59,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:59,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 13:30:59,170 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:59,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1612604960, now seen corresponding path program 3 times [2024-05-12 13:30:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:59,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743511409] [2024-05-12 13:30:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:59,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743511409] [2024-05-12 13:30:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743511409] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:59,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:59,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:30:59,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593830117] [2024-05-12 13:30:59,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:59,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:30:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:30:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:30:59,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:30:59,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 179 transitions, 1953 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:59,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:59,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:30:59,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:00,526 INFO L124 PetriNetUnfolderBase]: 1019/2192 cut-off events. [2024-05-12 13:31:00,526 INFO L125 PetriNetUnfolderBase]: For 18555/18555 co-relation queries the response was YES. [2024-05-12 13:31:00,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8991 conditions, 2192 events. 1019/2192 cut-off events. For 18555/18555 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14906 event pairs, 232 based on Foata normal form. 2/2053 useless extension candidates. Maximal degree in co-relation 8903. Up to 1634 conditions per place. [2024-05-12 13:31:00,539 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 172 selfloop transitions, 24 changer transitions 0/206 dead transitions. [2024-05-12 13:31:00,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 206 transitions, 2451 flow [2024-05-12 13:31:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:31:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:31:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 13:31:00,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775641025641026 [2024-05-12 13:31:00,541 INFO L175 Difference]: Start difference. First operand has 187 places, 179 transitions, 1953 flow. Second operand 8 states and 149 transitions. [2024-05-12 13:31:00,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 206 transitions, 2451 flow [2024-05-12 13:31:00,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 206 transitions, 2317 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 13:31:00,610 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 1883 flow [2024-05-12 13:31:00,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1883, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2024-05-12 13:31:00,610 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places. [2024-05-12 13:31:00,610 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 1883 flow [2024-05-12 13:31:00,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:00,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:00,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 13:31:00,611 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:00,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash -497409388, now seen corresponding path program 4 times [2024-05-12 13:31:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989151621] [2024-05-12 13:31:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:01,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989151621] [2024-05-12 13:31:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989151621] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:01,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467298988] [2024-05-12 13:31:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:01,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:01,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:01,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 1883 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:01,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:01,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:01,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:01,869 INFO L124 PetriNetUnfolderBase]: 1040/2244 cut-off events. [2024-05-12 13:31:01,870 INFO L125 PetriNetUnfolderBase]: For 19112/19112 co-relation queries the response was YES. [2024-05-12 13:31:01,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9085 conditions, 2244 events. 1040/2244 cut-off events. For 19112/19112 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15441 event pairs, 309 based on Foata normal form. 2/2096 useless extension candidates. Maximal degree in co-relation 8996. Up to 1268 conditions per place. [2024-05-12 13:31:01,888 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 143 selfloop transitions, 55 changer transitions 0/208 dead transitions. [2024-05-12 13:31:01,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 2478 flow [2024-05-12 13:31:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:31:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:31:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-05-12 13:31:01,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2024-05-12 13:31:01,890 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 1883 flow. Second operand 8 states and 154 transitions. [2024-05-12 13:31:01,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 2478 flow [2024-05-12 13:31:01,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 208 transitions, 2424 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 13:31:01,981 INFO L231 Difference]: Finished difference. Result has 191 places, 182 transitions, 1969 flow [2024-05-12 13:31:01,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1969, PETRI_PLACES=191, PETRI_TRANSITIONS=182} [2024-05-12 13:31:01,982 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places. [2024-05-12 13:31:01,982 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 182 transitions, 1969 flow [2024-05-12 13:31:01,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:01,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:01,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:01,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 13:31:01,987 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:01,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1471775478, now seen corresponding path program 5 times [2024-05-12 13:31:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716528652] [2024-05-12 13:31:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:02,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-05-12 13:31:02,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:02,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716528652] [2024-05-12 13:31:02,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716528652] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:02,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:02,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:02,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144113703] [2024-05-12 13:31:02,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:02,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:02,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:02,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:02,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 182 transitions, 1969 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:02,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:02,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:02,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:03,294 INFO L124 PetriNetUnfolderBase]: 1103/2404 cut-off events. [2024-05-12 13:31:03,295 INFO L125 PetriNetUnfolderBase]: For 20835/20835 co-relation queries the response was YES. [2024-05-12 13:31:03,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9803 conditions, 2404 events. 1103/2404 cut-off events. For 20835/20835 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16899 event pairs, 345 based on Foata normal form. 2/2241 useless extension candidates. Maximal degree in co-relation 9713. Up to 1741 conditions per place. [2024-05-12 13:31:03,313 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 163 selfloop transitions, 40 changer transitions 0/213 dead transitions. [2024-05-12 13:31:03,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 213 transitions, 2552 flow [2024-05-12 13:31:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:31:03,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564102564102564 [2024-05-12 13:31:03,314 INFO L175 Difference]: Start difference. First operand has 191 places, 182 transitions, 1969 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:31:03,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 213 transitions, 2552 flow [2024-05-12 13:31:03,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 213 transitions, 2471 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 13:31:03,388 INFO L231 Difference]: Finished difference. Result has 199 places, 190 transitions, 2082 flow [2024-05-12 13:31:03,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2082, PETRI_PLACES=199, PETRI_TRANSITIONS=190} [2024-05-12 13:31:03,388 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2024-05-12 13:31:03,388 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 190 transitions, 2082 flow [2024-05-12 13:31:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:03,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:03,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:03,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 13:31:03,389 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:03,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -53223464, now seen corresponding path program 6 times [2024-05-12 13:31:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841741563] [2024-05-12 13:31:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841741563] [2024-05-12 13:31:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841741563] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:04,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232735190] [2024-05-12 13:31:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:04,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:04,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:04,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:04,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 190 transitions, 2082 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:04,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:04,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:04,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:04,655 INFO L124 PetriNetUnfolderBase]: 1154/2518 cut-off events. [2024-05-12 13:31:04,655 INFO L125 PetriNetUnfolderBase]: For 21690/21690 co-relation queries the response was YES. [2024-05-12 13:31:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10361 conditions, 2518 events. 1154/2518 cut-off events. For 21690/21690 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17944 event pairs, 362 based on Foata normal form. 2/2348 useless extension candidates. Maximal degree in co-relation 10267. Up to 1834 conditions per place. [2024-05-12 13:31:04,674 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 166 selfloop transitions, 40 changer transitions 0/216 dead transitions. [2024-05-12 13:31:04,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 216 transitions, 2618 flow [2024-05-12 13:31:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 13:31:04,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757834757834758 [2024-05-12 13:31:04,676 INFO L175 Difference]: Start difference. First operand has 199 places, 190 transitions, 2082 flow. Second operand 9 states and 167 transitions. [2024-05-12 13:31:04,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 216 transitions, 2618 flow [2024-05-12 13:31:04,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 216 transitions, 2555 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 13:31:04,769 INFO L231 Difference]: Finished difference. Result has 203 places, 193 transitions, 2145 flow [2024-05-12 13:31:04,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2145, PETRI_PLACES=203, PETRI_TRANSITIONS=193} [2024-05-12 13:31:04,769 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places. [2024-05-12 13:31:04,770 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 193 transitions, 2145 flow [2024-05-12 13:31:04,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:04,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:04,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:04,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 13:31:04,770 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:04,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash 366727124, now seen corresponding path program 1 times [2024-05-12 13:31:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:04,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298182306] [2024-05-12 13:31:04,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:04,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:05,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298182306] [2024-05-12 13:31:05,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298182306] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:05,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:05,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494645996] [2024-05-12 13:31:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:05,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:05,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:05,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:05,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 193 transitions, 2145 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:05,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:05,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:05,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:06,107 INFO L124 PetriNetUnfolderBase]: 1161/2536 cut-off events. [2024-05-12 13:31:06,108 INFO L125 PetriNetUnfolderBase]: For 22522/22522 co-relation queries the response was YES. [2024-05-12 13:31:06,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10534 conditions, 2536 events. 1161/2536 cut-off events. For 22522/22522 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18048 event pairs, 362 based on Foata normal form. 1/2354 useless extension candidates. Maximal degree in co-relation 10440. Up to 1756 conditions per place. [2024-05-12 13:31:06,129 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 108 selfloop transitions, 93 changer transitions 0/211 dead transitions. [2024-05-12 13:31:06,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 211 transitions, 2671 flow [2024-05-12 13:31:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-05-12 13:31:06,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47293447293447294 [2024-05-12 13:31:06,130 INFO L175 Difference]: Start difference. First operand has 203 places, 193 transitions, 2145 flow. Second operand 9 states and 166 transitions. [2024-05-12 13:31:06,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 211 transitions, 2671 flow [2024-05-12 13:31:06,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 211 transitions, 2584 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 13:31:06,217 INFO L231 Difference]: Finished difference. Result has 208 places, 197 transitions, 2350 flow [2024-05-12 13:31:06,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2350, PETRI_PLACES=208, PETRI_TRANSITIONS=197} [2024-05-12 13:31:06,217 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places. [2024-05-12 13:31:06,218 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 197 transitions, 2350 flow [2024-05-12 13:31:06,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:06,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:06,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 13:31:06,218 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:06,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 213015572, now seen corresponding path program 2 times [2024-05-12 13:31:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739150028] [2024-05-12 13:31:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:07,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739150028] [2024-05-12 13:31:07,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739150028] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:07,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:07,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:07,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127005869] [2024-05-12 13:31:07,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:07,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:07,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:07,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:07,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:07,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 197 transitions, 2350 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:07,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:07,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:07,541 INFO L124 PetriNetUnfolderBase]: 1168/2533 cut-off events. [2024-05-12 13:31:07,542 INFO L125 PetriNetUnfolderBase]: For 23885/23885 co-relation queries the response was YES. [2024-05-12 13:31:07,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10830 conditions, 2533 events. 1168/2533 cut-off events. For 23885/23885 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 18019 event pairs, 362 based on Foata normal form. 1/2353 useless extension candidates. Maximal degree in co-relation 10734. Up to 1761 conditions per place. [2024-05-12 13:31:07,563 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 110 selfloop transitions, 95 changer transitions 0/215 dead transitions. [2024-05-12 13:31:07,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 215 transitions, 2878 flow [2024-05-12 13:31:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:31:07,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641025641025641 [2024-05-12 13:31:07,564 INFO L175 Difference]: Start difference. First operand has 208 places, 197 transitions, 2350 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:31:07,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 215 transitions, 2878 flow [2024-05-12 13:31:07,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 215 transitions, 2684 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 13:31:07,663 INFO L231 Difference]: Finished difference. Result has 212 places, 199 transitions, 2411 flow [2024-05-12 13:31:07,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2411, PETRI_PLACES=212, PETRI_TRANSITIONS=199} [2024-05-12 13:31:07,663 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 169 predicate places. [2024-05-12 13:31:07,663 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 199 transitions, 2411 flow [2024-05-12 13:31:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:07,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:07,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:07,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 13:31:07,664 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:07,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash -320412288, now seen corresponding path program 7 times [2024-05-12 13:31:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113620583] [2024-05-12 13:31:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:08,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-05-12 13:31:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113620583] [2024-05-12 13:31:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113620583] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:08,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:08,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990638902] [2024-05-12 13:31:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:08,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:08,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:08,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 199 transitions, 2411 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:08,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:08,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:08,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:09,065 INFO L124 PetriNetUnfolderBase]: 1185/2575 cut-off events. [2024-05-12 13:31:09,065 INFO L125 PetriNetUnfolderBase]: For 25638/25638 co-relation queries the response was YES. [2024-05-12 13:31:09,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11015 conditions, 2575 events. 1185/2575 cut-off events. For 25638/25638 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18421 event pairs, 387 based on Foata normal form. 2/2400 useless extension candidates. Maximal degree in co-relation 10918. Up to 1937 conditions per place. [2024-05-12 13:31:09,088 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 171 selfloop transitions, 39 changer transitions 0/220 dead transitions. [2024-05-12 13:31:09,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 220 transitions, 2923 flow [2024-05-12 13:31:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:31:09,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564102564102564 [2024-05-12 13:31:09,090 INFO L175 Difference]: Start difference. First operand has 212 places, 199 transitions, 2411 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:31:09,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 220 transitions, 2923 flow [2024-05-12 13:31:09,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 2692 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-05-12 13:31:09,188 INFO L231 Difference]: Finished difference. Result has 214 places, 200 transitions, 2280 flow [2024-05-12 13:31:09,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2280, PETRI_PLACES=214, PETRI_TRANSITIONS=200} [2024-05-12 13:31:09,188 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places. [2024-05-12 13:31:09,189 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 200 transitions, 2280 flow [2024-05-12 13:31:09,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:09,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:09,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 13:31:09,190 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:09,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -683422150, now seen corresponding path program 8 times [2024-05-12 13:31:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350240317] [2024-05-12 13:31:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:10,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350240317] [2024-05-12 13:31:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350240317] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301898297] [2024-05-12 13:31:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:10,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:10,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 200 transitions, 2280 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:10,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:10,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:10,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:10,789 INFO L124 PetriNetUnfolderBase]: 1222/2651 cut-off events. [2024-05-12 13:31:10,790 INFO L125 PetriNetUnfolderBase]: For 28272/28272 co-relation queries the response was YES. [2024-05-12 13:31:10,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11300 conditions, 2651 events. 1222/2651 cut-off events. For 28272/28272 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19063 event pairs, 395 based on Foata normal form. 2/2476 useless extension candidates. Maximal degree in co-relation 11202. Up to 1907 conditions per place. [2024-05-12 13:31:10,810 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 176 selfloop transitions, 39 changer transitions 0/225 dead transitions. [2024-05-12 13:31:10,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 225 transitions, 2920 flow [2024-05-12 13:31:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:31:10,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-05-12 13:31:10,812 INFO L175 Difference]: Start difference. First operand has 214 places, 200 transitions, 2280 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:31:10,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 225 transitions, 2920 flow [2024-05-12 13:31:10,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 225 transitions, 2814 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:10,938 INFO L231 Difference]: Finished difference. Result has 214 places, 202 transitions, 2294 flow [2024-05-12 13:31:10,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2294, PETRI_PLACES=214, PETRI_TRANSITIONS=202} [2024-05-12 13:31:10,939 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places. [2024-05-12 13:31:10,939 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 202 transitions, 2294 flow [2024-05-12 13:31:10,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:10,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:10,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:10,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 13:31:10,940 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:10,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash -683214760, now seen corresponding path program 9 times [2024-05-12 13:31:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518519319] [2024-05-12 13:31:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:11,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:11,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518519319] [2024-05-12 13:31:11,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518519319] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:11,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56471693] [2024-05-12 13:31:11,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:11,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:11,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:11,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 202 transitions, 2294 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:11,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:11,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:11,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:12,443 INFO L124 PetriNetUnfolderBase]: 1245/2711 cut-off events. [2024-05-12 13:31:12,444 INFO L125 PetriNetUnfolderBase]: For 29724/29724 co-relation queries the response was YES. [2024-05-12 13:31:12,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11568 conditions, 2711 events. 1245/2711 cut-off events. For 29724/29724 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19648 event pairs, 411 based on Foata normal form. 2/2527 useless extension candidates. Maximal degree in co-relation 11470. Up to 2042 conditions per place. [2024-05-12 13:31:12,469 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 175 selfloop transitions, 38 changer transitions 0/223 dead transitions. [2024-05-12 13:31:12,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 223 transitions, 2833 flow [2024-05-12 13:31:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 13:31:12,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46438746438746437 [2024-05-12 13:31:12,470 INFO L175 Difference]: Start difference. First operand has 214 places, 202 transitions, 2294 flow. Second operand 9 states and 163 transitions. [2024-05-12 13:31:12,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 223 transitions, 2833 flow [2024-05-12 13:31:12,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 223 transitions, 2756 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 13:31:12,592 INFO L231 Difference]: Finished difference. Result has 218 places, 205 transitions, 2344 flow [2024-05-12 13:31:12,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2344, PETRI_PLACES=218, PETRI_TRANSITIONS=205} [2024-05-12 13:31:12,593 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places. [2024-05-12 13:31:12,593 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 205 transitions, 2344 flow [2024-05-12 13:31:12,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:12,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:12,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:12,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 13:31:12,594 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:12,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash -426714250, now seen corresponding path program 10 times [2024-05-12 13:31:12,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673982979] [2024-05-12 13:31:12,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:12,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:13,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673982979] [2024-05-12 13:31:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673982979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:13,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523378294] [2024-05-12 13:31:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:13,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:13,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:13,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:13,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 205 transitions, 2344 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:13,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:13,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:13,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:14,037 INFO L124 PetriNetUnfolderBase]: 1242/2706 cut-off events. [2024-05-12 13:31:14,037 INFO L125 PetriNetUnfolderBase]: For 27708/27708 co-relation queries the response was YES. [2024-05-12 13:31:14,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11452 conditions, 2706 events. 1242/2706 cut-off events. For 27708/27708 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19629 event pairs, 410 based on Foata normal form. 2/2522 useless extension candidates. Maximal degree in co-relation 11352. Up to 2037 conditions per place. [2024-05-12 13:31:14,064 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 176 selfloop transitions, 37 changer transitions 0/223 dead transitions. [2024-05-12 13:31:14,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 223 transitions, 2838 flow [2024-05-12 13:31:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 13:31:14,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46438746438746437 [2024-05-12 13:31:14,065 INFO L175 Difference]: Start difference. First operand has 218 places, 205 transitions, 2344 flow. Second operand 9 states and 163 transitions. [2024-05-12 13:31:14,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 223 transitions, 2838 flow [2024-05-12 13:31:14,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 223 transitions, 2744 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-05-12 13:31:14,187 INFO L231 Difference]: Finished difference. Result has 221 places, 205 transitions, 2328 flow [2024-05-12 13:31:14,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2328, PETRI_PLACES=221, PETRI_TRANSITIONS=205} [2024-05-12 13:31:14,188 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places. [2024-05-12 13:31:14,188 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 205 transitions, 2328 flow [2024-05-12 13:31:14,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:14,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:14,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:14,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 13:31:14,189 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:14,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1502681452, now seen corresponding path program 3 times [2024-05-12 13:31:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:14,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153881972] [2024-05-12 13:31:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:15,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153881972] [2024-05-12 13:31:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153881972] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:15,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970128115] [2024-05-12 13:31:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:15,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:15,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:15,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 205 transitions, 2328 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:15,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:15,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:15,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:15,863 INFO L124 PetriNetUnfolderBase]: 1258/2732 cut-off events. [2024-05-12 13:31:15,863 INFO L125 PetriNetUnfolderBase]: For 29173/29173 co-relation queries the response was YES. [2024-05-12 13:31:15,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11679 conditions, 2732 events. 1258/2732 cut-off events. For 29173/29173 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19779 event pairs, 394 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 11578. Up to 1886 conditions per place. [2024-05-12 13:31:15,889 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 116 selfloop transitions, 104 changer transitions 0/230 dead transitions. [2024-05-12 13:31:15,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 230 transitions, 3064 flow [2024-05-12 13:31:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:31:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:31:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-05-12 13:31:15,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-05-12 13:31:15,891 INFO L175 Difference]: Start difference. First operand has 221 places, 205 transitions, 2328 flow. Second operand 12 states and 213 transitions. [2024-05-12 13:31:15,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 230 transitions, 3064 flow [2024-05-12 13:31:16,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 2965 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:16,028 INFO L231 Difference]: Finished difference. Result has 224 places, 209 transitions, 2566 flow [2024-05-12 13:31:16,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2229, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2566, PETRI_PLACES=224, PETRI_TRANSITIONS=209} [2024-05-12 13:31:16,029 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places. [2024-05-12 13:31:16,029 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 209 transitions, 2566 flow [2024-05-12 13:31:16,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:16,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:16,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:16,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 13:31:16,030 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:16,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 400066196, now seen corresponding path program 4 times [2024-05-12 13:31:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026898967] [2024-05-12 13:31:16,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026898967] [2024-05-12 13:31:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026898967] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:17,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115249203] [2024-05-12 13:31:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:17,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:17,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:17,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 209 transitions, 2566 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:17,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:17,939 INFO L124 PetriNetUnfolderBase]: 1265/2729 cut-off events. [2024-05-12 13:31:17,939 INFO L125 PetriNetUnfolderBase]: For 31124/31124 co-relation queries the response was YES. [2024-05-12 13:31:17,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11999 conditions, 2729 events. 1265/2729 cut-off events. For 31124/31124 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19753 event pairs, 394 based on Foata normal form. 1/2536 useless extension candidates. Maximal degree in co-relation 11897. Up to 1938 conditions per place. [2024-05-12 13:31:17,965 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 133 selfloop transitions, 86 changer transitions 0/229 dead transitions. [2024-05-12 13:31:17,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 229 transitions, 3138 flow [2024-05-12 13:31:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 13:31:17,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592074592074592 [2024-05-12 13:31:17,968 INFO L175 Difference]: Start difference. First operand has 224 places, 209 transitions, 2566 flow. Second operand 11 states and 197 transitions. [2024-05-12 13:31:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 229 transitions, 3138 flow [2024-05-12 13:31:18,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 229 transitions, 2923 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:18,135 INFO L231 Difference]: Finished difference. Result has 226 places, 211 transitions, 2596 flow [2024-05-12 13:31:18,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2596, PETRI_PLACES=226, PETRI_TRANSITIONS=211} [2024-05-12 13:31:18,136 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-05-12 13:31:18,136 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 211 transitions, 2596 flow [2024-05-12 13:31:18,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:18,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:18,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:18,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 13:31:18,137 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:18,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:18,137 INFO L85 PathProgramCache]: Analyzing trace with hash -417183114, now seen corresponding path program 5 times [2024-05-12 13:31:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:18,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268961852] [2024-05-12 13:31:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268961852] [2024-05-12 13:31:19,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268961852] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:19,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:19,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870717522] [2024-05-12 13:31:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:19,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:19,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:19,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:19,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 211 transitions, 2596 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:19,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:19,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:19,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:20,087 INFO L124 PetriNetUnfolderBase]: 1269/2741 cut-off events. [2024-05-12 13:31:20,087 INFO L125 PetriNetUnfolderBase]: For 29587/29587 co-relation queries the response was YES. [2024-05-12 13:31:20,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11961 conditions, 2741 events. 1269/2741 cut-off events. For 29587/29587 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19830 event pairs, 410 based on Foata normal form. 1/2552 useless extension candidates. Maximal degree in co-relation 11858. Up to 2017 conditions per place. [2024-05-12 13:31:20,110 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 167 selfloop transitions, 54 changer transitions 0/231 dead transitions. [2024-05-12 13:31:20,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 231 transitions, 3132 flow [2024-05-12 13:31:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:31:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:31:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2024-05-12 13:31:20,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2024-05-12 13:31:20,111 INFO L175 Difference]: Start difference. First operand has 226 places, 211 transitions, 2596 flow. Second operand 12 states and 207 transitions. [2024-05-12 13:31:20,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 231 transitions, 3132 flow [2024-05-12 13:31:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 231 transitions, 2909 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:20,249 INFO L231 Difference]: Finished difference. Result has 229 places, 213 transitions, 2510 flow [2024-05-12 13:31:20,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2510, PETRI_PLACES=229, PETRI_TRANSITIONS=213} [2024-05-12 13:31:20,250 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2024-05-12 13:31:20,250 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 213 transitions, 2510 flow [2024-05-12 13:31:20,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:20,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:20,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:20,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 13:31:20,250 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:20,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1873579402, now seen corresponding path program 6 times [2024-05-12 13:31:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:20,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359845206] [2024-05-12 13:31:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359845206] [2024-05-12 13:31:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359845206] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175060075] [2024-05-12 13:31:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:21,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:21,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:21,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:21,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 213 transitions, 2510 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:21,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:21,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:21,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:21,838 INFO L124 PetriNetUnfolderBase]: 1267/2735 cut-off events. [2024-05-12 13:31:21,839 INFO L125 PetriNetUnfolderBase]: For 27882/27882 co-relation queries the response was YES. [2024-05-12 13:31:21,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11691 conditions, 2735 events. 1267/2735 cut-off events. For 27882/27882 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19784 event pairs, 394 based on Foata normal form. 1/2541 useless extension candidates. Maximal degree in co-relation 11587. Up to 1939 conditions per place. [2024-05-12 13:31:21,861 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 128 selfloop transitions, 93 changer transitions 0/231 dead transitions. [2024-05-12 13:31:21,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 231 transitions, 3022 flow [2024-05-12 13:31:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 13:31:21,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568764568764569 [2024-05-12 13:31:21,863 INFO L175 Difference]: Start difference. First operand has 229 places, 213 transitions, 2510 flow. Second operand 11 states and 196 transitions. [2024-05-12 13:31:21,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 231 transitions, 3022 flow [2024-05-12 13:31:21,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 231 transitions, 2719 flow, removed 38 selfloop flow, removed 11 redundant places. [2024-05-12 13:31:21,979 INFO L231 Difference]: Finished difference. Result has 229 places, 213 transitions, 2398 flow [2024-05-12 13:31:21,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2398, PETRI_PLACES=229, PETRI_TRANSITIONS=213} [2024-05-12 13:31:21,979 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2024-05-12 13:31:21,979 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 213 transitions, 2398 flow [2024-05-12 13:31:21,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:21,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:21,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:31:21,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 13:31:21,980 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:21,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1308429578, now seen corresponding path program 11 times [2024-05-12 13:31:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:21,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581807997] [2024-05-12 13:31:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:22,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-05-12 13:31:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581807997] [2024-05-12 13:31:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581807997] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:31:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266851224] [2024-05-12 13:31:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:22,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:31:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:31:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:31:22,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:22,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 213 transitions, 2398 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:22,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:22,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:22,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:23,319 INFO L124 PetriNetUnfolderBase]: 1264/2726 cut-off events. [2024-05-12 13:31:23,320 INFO L125 PetriNetUnfolderBase]: For 24916/24916 co-relation queries the response was YES. [2024-05-12 13:31:23,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11328 conditions, 2726 events. 1264/2726 cut-off events. For 24916/24916 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19706 event pairs, 367 based on Foata normal form. 2/2537 useless extension candidates. Maximal degree in co-relation 11225. Up to 1936 conditions per place. [2024-05-12 13:31:23,346 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 162 selfloop transitions, 61 changer transitions 0/233 dead transitions. [2024-05-12 13:31:23,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 233 transitions, 2918 flow [2024-05-12 13:31:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:31:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:31:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-05-12 13:31:23,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-05-12 13:31:23,351 INFO L175 Difference]: Start difference. First operand has 229 places, 213 transitions, 2398 flow. Second operand 8 states and 152 transitions. [2024-05-12 13:31:23,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 233 transitions, 2918 flow [2024-05-12 13:31:23,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 233 transitions, 2690 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-05-12 13:31:23,458 INFO L231 Difference]: Finished difference. Result has 227 places, 213 transitions, 2298 flow [2024-05-12 13:31:23,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2298, PETRI_PLACES=227, PETRI_TRANSITIONS=213} [2024-05-12 13:31:23,458 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places. [2024-05-12 13:31:23,458 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 213 transitions, 2298 flow [2024-05-12 13:31:23,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:23,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:23,459 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-05-12 13:31:23,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 13:31:23,460 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:23,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1661249528, now seen corresponding path program 1 times [2024-05-12 13:31:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613952527] [2024-05-12 13:31:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:24,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-05-12 13:31:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613952527] [2024-05-12 13:31:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613952527] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355675474] [2024-05-12 13:31:24,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:24,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:24,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:24,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:24,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:24,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 213 transitions, 2298 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:24,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:24,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:24,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:25,023 INFO L124 PetriNetUnfolderBase]: 1281/2775 cut-off events. [2024-05-12 13:31:25,024 INFO L125 PetriNetUnfolderBase]: For 25410/25410 co-relation queries the response was YES. [2024-05-12 13:31:25,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11355 conditions, 2775 events. 1281/2775 cut-off events. For 25410/25410 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20085 event pairs, 310 based on Foata normal form. 2/2598 useless extension candidates. Maximal degree in co-relation 11251. Up to 2061 conditions per place. [2024-05-12 13:31:25,048 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 211 selfloop transitions, 25 changer transitions 0/246 dead transitions. [2024-05-12 13:31:25,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 246 transitions, 2896 flow [2024-05-12 13:31:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 13:31:25,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757834757834758 [2024-05-12 13:31:25,049 INFO L175 Difference]: Start difference. First operand has 227 places, 213 transitions, 2298 flow. Second operand 9 states and 167 transitions. [2024-05-12 13:31:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 246 transitions, 2896 flow [2024-05-12 13:31:25,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 246 transitions, 2697 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-05-12 13:31:25,159 INFO L231 Difference]: Finished difference. Result has 226 places, 214 transitions, 2163 flow [2024-05-12 13:31:25,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2163, PETRI_PLACES=226, PETRI_TRANSITIONS=214} [2024-05-12 13:31:25,159 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-05-12 13:31:25,159 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 214 transitions, 2163 flow [2024-05-12 13:31:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:25,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:25,160 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-05-12 13:31:25,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 13:31:25,160 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:25,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1937310648, now seen corresponding path program 2 times [2024-05-12 13:31:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:25,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086859822] [2024-05-12 13:31:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086859822] [2024-05-12 13:31:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086859822] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443557167] [2024-05-12 13:31:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:25,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:25,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:25,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:25,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 214 transitions, 2163 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:25,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:25,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:25,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:26,479 INFO L124 PetriNetUnfolderBase]: 1318/2875 cut-off events. [2024-05-12 13:31:26,480 INFO L125 PetriNetUnfolderBase]: For 27323/27323 co-relation queries the response was YES. [2024-05-12 13:31:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11335 conditions, 2875 events. 1318/2875 cut-off events. For 27323/27323 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 21099 event pairs, 406 based on Foata normal form. 2/2675 useless extension candidates. Maximal degree in co-relation 11234. Up to 1837 conditions per place. [2024-05-12 13:31:26,504 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 142 selfloop transitions, 87 changer transitions 0/239 dead transitions. [2024-05-12 13:31:26,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 239 transitions, 2831 flow [2024-05-12 13:31:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-05-12 13:31:26,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-05-12 13:31:26,509 INFO L175 Difference]: Start difference. First operand has 226 places, 214 transitions, 2163 flow. Second operand 9 states and 171 transitions. [2024-05-12 13:31:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 239 transitions, 2831 flow [2024-05-12 13:31:26,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 239 transitions, 2777 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 13:31:26,630 INFO L231 Difference]: Finished difference. Result has 228 places, 216 transitions, 2312 flow [2024-05-12 13:31:26,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2312, PETRI_PLACES=228, PETRI_TRANSITIONS=216} [2024-05-12 13:31:26,630 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places. [2024-05-12 13:31:26,631 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 216 transitions, 2312 flow [2024-05-12 13:31:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:26,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:26,631 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-05-12 13:31:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 13:31:26,632 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:26,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1240837278, now seen corresponding path program 3 times [2024-05-12 13:31:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074577913] [2024-05-12 13:31:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074577913] [2024-05-12 13:31:27,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074577913] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766441515] [2024-05-12 13:31:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:27,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:27,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:27,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:27,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:27,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 216 transitions, 2312 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:27,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:27,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:27,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:27,893 INFO L124 PetriNetUnfolderBase]: 1315/2872 cut-off events. [2024-05-12 13:31:27,893 INFO L125 PetriNetUnfolderBase]: For 26114/26114 co-relation queries the response was YES. [2024-05-12 13:31:27,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 2872 events. 1315/2872 cut-off events. For 26114/26114 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 21041 event pairs, 418 based on Foata normal form. 2/2668 useless extension candidates. Maximal degree in co-relation 11378. Up to 1994 conditions per place. [2024-05-12 13:31:27,917 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 136 selfloop transitions, 88 changer transitions 0/234 dead transitions. [2024-05-12 13:31:27,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 234 transitions, 2828 flow [2024-05-12 13:31:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 13:31:27,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757834757834758 [2024-05-12 13:31:27,918 INFO L175 Difference]: Start difference. First operand has 228 places, 216 transitions, 2312 flow. Second operand 9 states and 167 transitions. [2024-05-12 13:31:27,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 234 transitions, 2828 flow [2024-05-12 13:31:28,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 234 transitions, 2682 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 13:31:28,052 INFO L231 Difference]: Finished difference. Result has 231 places, 216 transitions, 2349 flow [2024-05-12 13:31:28,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2349, PETRI_PLACES=231, PETRI_TRANSITIONS=216} [2024-05-12 13:31:28,053 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places. [2024-05-12 13:31:28,053 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 216 transitions, 2349 flow [2024-05-12 13:31:28,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:28,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:28,054 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-05-12 13:31:28,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 13:31:28,054 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:28,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1848062414, now seen corresponding path program 4 times [2024-05-12 13:31:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969137883] [2024-05-12 13:31:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969137883] [2024-05-12 13:31:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969137883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141446638] [2024-05-12 13:31:28,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:28,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:28,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:28,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:28,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 216 transitions, 2349 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:28,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:28,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:28,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:29,477 INFO L124 PetriNetUnfolderBase]: 1332/2871 cut-off events. [2024-05-12 13:31:29,477 INFO L125 PetriNetUnfolderBase]: For 26302/26302 co-relation queries the response was YES. [2024-05-12 13:31:29,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11603 conditions, 2871 events. 1332/2871 cut-off events. For 26302/26302 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 20934 event pairs, 366 based on Foata normal form. 2/2683 useless extension candidates. Maximal degree in co-relation 11500. Up to 1583 conditions per place. [2024-05-12 13:31:29,502 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 146 selfloop transitions, 87 changer transitions 0/243 dead transitions. [2024-05-12 13:31:29,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 243 transitions, 2921 flow [2024-05-12 13:31:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 13:31:29,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928774928774929 [2024-05-12 13:31:29,503 INFO L175 Difference]: Start difference. First operand has 231 places, 216 transitions, 2349 flow. Second operand 9 states and 173 transitions. [2024-05-12 13:31:29,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 243 transitions, 2921 flow [2024-05-12 13:31:29,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 243 transitions, 2736 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 13:31:29,619 INFO L231 Difference]: Finished difference. Result has 232 places, 217 transitions, 2357 flow [2024-05-12 13:31:29,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2357, PETRI_PLACES=232, PETRI_TRANSITIONS=217} [2024-05-12 13:31:29,620 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places. [2024-05-12 13:31:29,620 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 217 transitions, 2357 flow [2024-05-12 13:31:29,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:29,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:29,621 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-05-12 13:31:29,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 13:31:29,621 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:29,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -220830432, now seen corresponding path program 5 times [2024-05-12 13:31:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941586914] [2024-05-12 13:31:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941586914] [2024-05-12 13:31:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941586914] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:30,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994529488] [2024-05-12 13:31:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:30,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:30,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:30,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 217 transitions, 2357 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:30,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:30,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:30,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:31,010 INFO L124 PetriNetUnfolderBase]: 1353/2949 cut-off events. [2024-05-12 13:31:31,010 INFO L125 PetriNetUnfolderBase]: For 27650/27650 co-relation queries the response was YES. [2024-05-12 13:31:31,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11960 conditions, 2949 events. 1353/2949 cut-off events. For 27650/27650 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 21814 event pairs, 401 based on Foata normal form. 2/2759 useless extension candidates. Maximal degree in co-relation 11856. Up to 1196 conditions per place. [2024-05-12 13:31:31,030 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 170 selfloop transitions, 70 changer transitions 0/250 dead transitions. [2024-05-12 13:31:31,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 250 transitions, 3085 flow [2024-05-12 13:31:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:31:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:31:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-05-12 13:31:31,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2024-05-12 13:31:31,032 INFO L175 Difference]: Start difference. First operand has 232 places, 217 transitions, 2357 flow. Second operand 9 states and 174 transitions. [2024-05-12 13:31:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 250 transitions, 3085 flow [2024-05-12 13:31:31,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 250 transitions, 2908 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 13:31:31,188 INFO L231 Difference]: Finished difference. Result has 234 places, 219 transitions, 2350 flow [2024-05-12 13:31:31,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2350, PETRI_PLACES=234, PETRI_TRANSITIONS=219} [2024-05-12 13:31:31,198 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places. [2024-05-12 13:31:31,198 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 219 transitions, 2350 flow [2024-05-12 13:31:31,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:31,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:31,198 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-05-12 13:31:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 13:31:31,199 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:31,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1937556726, now seen corresponding path program 1 times [2024-05-12 13:31:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188200791] [2024-05-12 13:31:31,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188200791] [2024-05-12 13:31:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188200791] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928096071] [2024-05-12 13:31:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:32,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:32,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:32,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 219 transitions, 2350 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:32,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:32,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:32,889 INFO L124 PetriNetUnfolderBase]: 1407/3101 cut-off events. [2024-05-12 13:31:32,889 INFO L125 PetriNetUnfolderBase]: For 38494/38494 co-relation queries the response was YES. [2024-05-12 13:31:32,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12406 conditions, 3101 events. 1407/3101 cut-off events. For 38494/38494 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23457 event pairs, 455 based on Foata normal form. 8/2898 useless extension candidates. Maximal degree in co-relation 12301. Up to 2134 conditions per place. [2024-05-12 13:31:32,918 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 152 selfloop transitions, 80 changer transitions 0/242 dead transitions. [2024-05-12 13:31:32,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 2918 flow [2024-05-12 13:31:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 13:31:32,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794871794871795 [2024-05-12 13:31:32,919 INFO L175 Difference]: Start difference. First operand has 234 places, 219 transitions, 2350 flow. Second operand 10 states and 187 transitions. [2024-05-12 13:31:32,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 2918 flow [2024-05-12 13:31:33,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 242 transitions, 2827 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 13:31:33,062 INFO L231 Difference]: Finished difference. Result has 239 places, 219 transitions, 2428 flow [2024-05-12 13:31:33,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2428, PETRI_PLACES=239, PETRI_TRANSITIONS=219} [2024-05-12 13:31:33,062 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places. [2024-05-12 13:31:33,063 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 219 transitions, 2428 flow [2024-05-12 13:31:33,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:33,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:33,063 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-05-12 13:31:33,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 13:31:33,063 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:33,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1986094636, now seen corresponding path program 2 times [2024-05-12 13:31:33,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:33,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669223640] [2024-05-12 13:31:33,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669223640] [2024-05-12 13:31:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669223640] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:34,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311526317] [2024-05-12 13:31:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:34,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:34,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 219 transitions, 2428 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:34,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:34,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:35,000 INFO L124 PetriNetUnfolderBase]: 1545/3412 cut-off events. [2024-05-12 13:31:35,001 INFO L125 PetriNetUnfolderBase]: For 49663/49663 co-relation queries the response was YES. [2024-05-12 13:31:35,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14026 conditions, 3412 events. 1545/3412 cut-off events. For 49663/49663 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 26695 event pairs, 538 based on Foata normal form. 6/3202 useless extension candidates. Maximal degree in co-relation 13919. Up to 1962 conditions per place. [2024-05-12 13:31:35,038 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 139 selfloop transitions, 102 changer transitions 0/251 dead transitions. [2024-05-12 13:31:35,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 251 transitions, 3176 flow [2024-05-12 13:31:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:31:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:31:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2024-05-12 13:31:35,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 13:31:35,039 INFO L175 Difference]: Start difference. First operand has 239 places, 219 transitions, 2428 flow. Second operand 12 states and 221 transitions. [2024-05-12 13:31:35,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 251 transitions, 3176 flow [2024-05-12 13:31:35,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 251 transitions, 3017 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 13:31:35,248 INFO L231 Difference]: Finished difference. Result has 243 places, 219 transitions, 2476 flow [2024-05-12 13:31:35,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2476, PETRI_PLACES=243, PETRI_TRANSITIONS=219} [2024-05-12 13:31:35,249 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places. [2024-05-12 13:31:35,249 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 219 transitions, 2476 flow [2024-05-12 13:31:35,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:35,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:35,249 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-05-12 13:31:35,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 13:31:35,249 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:35,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1986450826, now seen corresponding path program 3 times [2024-05-12 13:31:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956063866] [2024-05-12 13:31:35,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956063866] [2024-05-12 13:31:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956063866] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168045674] [2024-05-12 13:31:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:36,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:36,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:36,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:36,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 219 transitions, 2476 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:36,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:36,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:36,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:37,236 INFO L124 PetriNetUnfolderBase]: 1558/3506 cut-off events. [2024-05-12 13:31:37,236 INFO L125 PetriNetUnfolderBase]: For 41730/41730 co-relation queries the response was YES. [2024-05-12 13:31:37,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13870 conditions, 3506 events. 1558/3506 cut-off events. For 41730/41730 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 27766 event pairs, 601 based on Foata normal form. 8/3276 useless extension candidates. Maximal degree in co-relation 13762. Up to 2444 conditions per place. [2024-05-12 13:31:37,267 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 179 selfloop transitions, 60 changer transitions 0/249 dead transitions. [2024-05-12 13:31:37,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 249 transitions, 3110 flow [2024-05-12 13:31:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:31:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:31:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2024-05-12 13:31:37,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 13:31:37,268 INFO L175 Difference]: Start difference. First operand has 243 places, 219 transitions, 2476 flow. Second operand 12 states and 216 transitions. [2024-05-12 13:31:37,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 249 transitions, 3110 flow [2024-05-12 13:31:37,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 249 transitions, 2903 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:31:37,426 INFO L231 Difference]: Finished difference. Result has 245 places, 222 transitions, 2433 flow [2024-05-12 13:31:37,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2433, PETRI_PLACES=245, PETRI_TRANSITIONS=222} [2024-05-12 13:31:37,427 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places. [2024-05-12 13:31:37,427 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 222 transitions, 2433 flow [2024-05-12 13:31:37,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:37,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:37,427 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-05-12 13:31:37,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 13:31:37,427 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:37,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash 288750802, now seen corresponding path program 6 times [2024-05-12 13:31:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342709498] [2024-05-12 13:31:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342709498] [2024-05-12 13:31:38,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342709498] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:38,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:38,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045061848] [2024-05-12 13:31:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:38,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:38,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:38,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:38,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 222 transitions, 2433 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:38,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:38,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:38,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:39,074 INFO L124 PetriNetUnfolderBase]: 1538/3416 cut-off events. [2024-05-12 13:31:39,074 INFO L125 PetriNetUnfolderBase]: For 32279/32279 co-relation queries the response was YES. [2024-05-12 13:31:39,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13690 conditions, 3416 events. 1538/3416 cut-off events. For 32279/32279 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 26748 event pairs, 549 based on Foata normal form. 2/3195 useless extension candidates. Maximal degree in co-relation 13581. Up to 2296 conditions per place. [2024-05-12 13:31:39,106 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 189 selfloop transitions, 53 changer transitions 0/252 dead transitions. [2024-05-12 13:31:39,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 252 transitions, 3155 flow [2024-05-12 13:31:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-05-12 13:31:39,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897435897435897 [2024-05-12 13:31:39,108 INFO L175 Difference]: Start difference. First operand has 245 places, 222 transitions, 2433 flow. Second operand 10 states and 191 transitions. [2024-05-12 13:31:39,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 252 transitions, 3155 flow [2024-05-12 13:31:39,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 252 transitions, 3039 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:39,268 INFO L231 Difference]: Finished difference. Result has 246 places, 223 transitions, 2439 flow [2024-05-12 13:31:39,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2439, PETRI_PLACES=246, PETRI_TRANSITIONS=223} [2024-05-12 13:31:39,269 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places. [2024-05-12 13:31:39,269 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 223 transitions, 2439 flow [2024-05-12 13:31:39,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:39,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:39,270 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-05-12 13:31:39,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 13:31:39,270 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:39,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 295417042, now seen corresponding path program 7 times [2024-05-12 13:31:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103861026] [2024-05-12 13:31:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:40,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103861026] [2024-05-12 13:31:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103861026] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:40,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373341552] [2024-05-12 13:31:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:40,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:40,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:40,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:40,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 223 transitions, 2439 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:40,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:40,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:40,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:40,980 INFO L124 PetriNetUnfolderBase]: 1561/3506 cut-off events. [2024-05-12 13:31:40,980 INFO L125 PetriNetUnfolderBase]: For 33487/33487 co-relation queries the response was YES. [2024-05-12 13:31:41,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14026 conditions, 3506 events. 1561/3506 cut-off events. For 33487/33487 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 27735 event pairs, 588 based on Foata normal form. 2/3268 useless extension candidates. Maximal degree in co-relation 13916. Up to 2575 conditions per place. [2024-05-12 13:31:41,017 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 183 selfloop transitions, 53 changer transitions 0/246 dead transitions. [2024-05-12 13:31:41,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 3026 flow [2024-05-12 13:31:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:31:41,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641025641025641 [2024-05-12 13:31:41,018 INFO L175 Difference]: Start difference. First operand has 246 places, 223 transitions, 2439 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:31:41,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 3026 flow [2024-05-12 13:31:41,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 246 transitions, 2821 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-05-12 13:31:41,237 INFO L231 Difference]: Finished difference. Result has 246 places, 226 transitions, 2385 flow [2024-05-12 13:31:41,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2385, PETRI_PLACES=246, PETRI_TRANSITIONS=226} [2024-05-12 13:31:41,238 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places. [2024-05-12 13:31:41,238 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 226 transitions, 2385 flow [2024-05-12 13:31:41,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:41,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:41,238 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-05-12 13:31:41,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 13:31:41,238 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:41,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1057508344, now seen corresponding path program 8 times [2024-05-12 13:31:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561718439] [2024-05-12 13:31:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561718439] [2024-05-12 13:31:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561718439] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:42,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:42,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408072262] [2024-05-12 13:31:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:42,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:42,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:42,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 226 transitions, 2385 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:42,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:42,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:42,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:42,963 INFO L124 PetriNetUnfolderBase]: 1584/3546 cut-off events. [2024-05-12 13:31:42,963 INFO L125 PetriNetUnfolderBase]: For 34043/34043 co-relation queries the response was YES. [2024-05-12 13:31:42,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13790 conditions, 3546 events. 1584/3546 cut-off events. For 34043/34043 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 28049 event pairs, 581 based on Foata normal form. 2/3303 useless extension candidates. Maximal degree in co-relation 13682. Up to 2613 conditions per place. [2024-05-12 13:31:42,994 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 185 selfloop transitions, 56 changer transitions 0/251 dead transitions. [2024-05-12 13:31:42,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 251 transitions, 2986 flow [2024-05-12 13:31:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:31:42,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 13:31:42,995 INFO L175 Difference]: Start difference. First operand has 246 places, 226 transitions, 2385 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:31:42,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 251 transitions, 2986 flow [2024-05-12 13:31:43,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 251 transitions, 2873 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 13:31:43,177 INFO L231 Difference]: Finished difference. Result has 250 places, 229 transitions, 2425 flow [2024-05-12 13:31:43,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2425, PETRI_PLACES=250, PETRI_TRANSITIONS=229} [2024-05-12 13:31:43,178 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places. [2024-05-12 13:31:43,178 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 229 transitions, 2425 flow [2024-05-12 13:31:43,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:43,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:43,179 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-05-12 13:31:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 13:31:43,179 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:43,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash -778076906, now seen corresponding path program 9 times [2024-05-12 13:31:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681935726] [2024-05-12 13:31:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:44,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-05-12 13:31:44,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:44,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681935726] [2024-05-12 13:31:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681935726] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:44,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:44,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266283356] [2024-05-12 13:31:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:44,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:44,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:44,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 229 transitions, 2425 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:44,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:44,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:44,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:45,035 INFO L124 PetriNetUnfolderBase]: 1601/3585 cut-off events. [2024-05-12 13:31:45,035 INFO L125 PetriNetUnfolderBase]: For 35015/35015 co-relation queries the response was YES. [2024-05-12 13:31:45,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13980 conditions, 3585 events. 1601/3585 cut-off events. For 35015/35015 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 28473 event pairs, 594 based on Foata normal form. 2/3340 useless extension candidates. Maximal degree in co-relation 13871. Up to 2644 conditions per place. [2024-05-12 13:31:45,138 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 185 selfloop transitions, 57 changer transitions 0/252 dead transitions. [2024-05-12 13:31:45,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 252 transitions, 3007 flow [2024-05-12 13:31:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 13:31:45,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592074592074592 [2024-05-12 13:31:45,139 INFO L175 Difference]: Start difference. First operand has 250 places, 229 transitions, 2425 flow. Second operand 11 states and 197 transitions. [2024-05-12 13:31:45,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 252 transitions, 3007 flow [2024-05-12 13:31:45,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 252 transitions, 2876 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:45,322 INFO L231 Difference]: Finished difference. Result has 252 places, 230 transitions, 2428 flow [2024-05-12 13:31:45,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2428, PETRI_PLACES=252, PETRI_TRANSITIONS=230} [2024-05-12 13:31:45,322 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places. [2024-05-12 13:31:45,323 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 230 transitions, 2428 flow [2024-05-12 13:31:45,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:45,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:45,323 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-05-12 13:31:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 13:31:45,323 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:45,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash -778314056, now seen corresponding path program 10 times [2024-05-12 13:31:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:45,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826473445] [2024-05-12 13:31:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826473445] [2024-05-12 13:31:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826473445] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:46,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:46,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078107263] [2024-05-12 13:31:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:46,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:46,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:46,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 230 transitions, 2428 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:46,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:46,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:46,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:46,986 INFO L124 PetriNetUnfolderBase]: 1618/3622 cut-off events. [2024-05-12 13:31:46,986 INFO L125 PetriNetUnfolderBase]: For 36022/36022 co-relation queries the response was YES. [2024-05-12 13:31:47,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14125 conditions, 3622 events. 1618/3622 cut-off events. For 36022/36022 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 28790 event pairs, 594 based on Foata normal form. 2/3378 useless extension candidates. Maximal degree in co-relation 14016. Up to 2581 conditions per place. [2024-05-12 13:31:47,019 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 188 selfloop transitions, 60 changer transitions 0/258 dead transitions. [2024-05-12 13:31:47,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 258 transitions, 3054 flow [2024-05-12 13:31:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-05-12 13:31:47,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46853146853146854 [2024-05-12 13:31:47,021 INFO L175 Difference]: Start difference. First operand has 252 places, 230 transitions, 2428 flow. Second operand 11 states and 201 transitions. [2024-05-12 13:31:47,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 258 transitions, 3054 flow [2024-05-12 13:31:47,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 258 transitions, 2939 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 13:31:47,230 INFO L231 Difference]: Finished difference. Result has 256 places, 232 transitions, 2471 flow [2024-05-12 13:31:47,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2471, PETRI_PLACES=256, PETRI_TRANSITIONS=232} [2024-05-12 13:31:47,239 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places. [2024-05-12 13:31:47,239 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 232 transitions, 2471 flow [2024-05-12 13:31:47,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:47,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:47,240 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-05-12 13:31:47,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 13:31:47,240 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:47,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 295179892, now seen corresponding path program 11 times [2024-05-12 13:31:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311436485] [2024-05-12 13:31:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311436485] [2024-05-12 13:31:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311436485] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:48,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043310322] [2024-05-12 13:31:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:48,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:48,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:48,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:48,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:48,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 232 transitions, 2471 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:48,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:48,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:48,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:48,937 INFO L124 PetriNetUnfolderBase]: 1635/3665 cut-off events. [2024-05-12 13:31:48,937 INFO L125 PetriNetUnfolderBase]: For 37376/37376 co-relation queries the response was YES. [2024-05-12 13:31:48,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14355 conditions, 3665 events. 1635/3665 cut-off events. For 37376/37376 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 29242 event pairs, 607 based on Foata normal form. 2/3419 useless extension candidates. Maximal degree in co-relation 14245. Up to 2654 conditions per place. [2024-05-12 13:31:48,974 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 191 selfloop transitions, 56 changer transitions 0/257 dead transitions. [2024-05-12 13:31:48,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 257 transitions, 3073 flow [2024-05-12 13:31:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 13:31:48,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2024-05-12 13:31:48,975 INFO L175 Difference]: Start difference. First operand has 256 places, 232 transitions, 2471 flow. Second operand 10 states and 186 transitions. [2024-05-12 13:31:48,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 257 transitions, 3073 flow [2024-05-12 13:31:49,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 257 transitions, 2978 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 13:31:49,185 INFO L231 Difference]: Finished difference. Result has 259 places, 233 transitions, 2512 flow [2024-05-12 13:31:49,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2512, PETRI_PLACES=259, PETRI_TRANSITIONS=233} [2024-05-12 13:31:49,186 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places. [2024-05-12 13:31:49,186 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 233 transitions, 2512 flow [2024-05-12 13:31:49,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:49,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:49,186 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-05-12 13:31:49,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 13:31:49,187 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:49,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash -622433178, now seen corresponding path program 12 times [2024-05-12 13:31:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312050171] [2024-05-12 13:31:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312050171] [2024-05-12 13:31:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312050171] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:49,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052952012] [2024-05-12 13:31:49,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:49,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:49,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:49,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:50,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:50,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 233 transitions, 2512 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:50,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:50,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:50,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:50,720 INFO L124 PetriNetUnfolderBase]: 1652/3713 cut-off events. [2024-05-12 13:31:50,720 INFO L125 PetriNetUnfolderBase]: For 38396/38396 co-relation queries the response was YES. [2024-05-12 13:31:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14632 conditions, 3713 events. 1652/3713 cut-off events. For 38396/38396 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 29769 event pairs, 623 based on Foata normal form. 2/3461 useless extension candidates. Maximal degree in co-relation 14520. Up to 2737 conditions per place. [2024-05-12 13:31:50,753 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 191 selfloop transitions, 53 changer transitions 0/254 dead transitions. [2024-05-12 13:31:50,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 254 transitions, 3096 flow [2024-05-12 13:31:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:31:50,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641025641025641 [2024-05-12 13:31:50,755 INFO L175 Difference]: Start difference. First operand has 259 places, 233 transitions, 2512 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:31:50,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 254 transitions, 3096 flow [2024-05-12 13:31:50,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 254 transitions, 2972 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-05-12 13:31:50,966 INFO L231 Difference]: Finished difference. Result has 261 places, 234 transitions, 2520 flow [2024-05-12 13:31:50,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2520, PETRI_PLACES=261, PETRI_TRANSITIONS=234} [2024-05-12 13:31:50,966 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places. [2024-05-12 13:31:50,967 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 234 transitions, 2520 flow [2024-05-12 13:31:50,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:50,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:50,967 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-05-12 13:31:50,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 13:31:50,967 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:50,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1924606940, now seen corresponding path program 13 times [2024-05-12 13:31:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:50,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556299841] [2024-05-12 13:31:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:50,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:51,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556299841] [2024-05-12 13:31:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556299841] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:51,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:51,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56076309] [2024-05-12 13:31:51,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:51,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:51,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:51,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 234 transitions, 2520 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:51,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:51,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:51,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:52,698 INFO L124 PetriNetUnfolderBase]: 1669/3743 cut-off events. [2024-05-12 13:31:52,699 INFO L125 PetriNetUnfolderBase]: For 39471/39471 co-relation queries the response was YES. [2024-05-12 13:31:52,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14767 conditions, 3743 events. 1669/3743 cut-off events. For 39471/39471 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 29995 event pairs, 626 based on Foata normal form. 2/3488 useless extension candidates. Maximal degree in co-relation 14654. Up to 2768 conditions per place. [2024-05-12 13:31:52,727 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 193 selfloop transitions, 52 changer transitions 0/255 dead transitions. [2024-05-12 13:31:52,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 255 transitions, 3108 flow [2024-05-12 13:31:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 13:31:52,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 13:31:52,728 INFO L175 Difference]: Start difference. First operand has 261 places, 234 transitions, 2520 flow. Second operand 10 states and 182 transitions. [2024-05-12 13:31:52,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 255 transitions, 3108 flow [2024-05-12 13:31:52,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 255 transitions, 2988 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-05-12 13:31:52,930 INFO L231 Difference]: Finished difference. Result has 263 places, 235 transitions, 2532 flow [2024-05-12 13:31:52,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2400, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2532, PETRI_PLACES=263, PETRI_TRANSITIONS=235} [2024-05-12 13:31:52,931 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 220 predicate places. [2024-05-12 13:31:52,931 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 235 transitions, 2532 flow [2024-05-12 13:31:52,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:52,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:52,932 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-05-12 13:31:52,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 13:31:52,932 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:52,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash 727220714, now seen corresponding path program 14 times [2024-05-12 13:31:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:52,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804652872] [2024-05-12 13:31:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:53,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-05-12 13:31:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804652872] [2024-05-12 13:31:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804652872] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:53,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:53,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:31:53,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654444582] [2024-05-12 13:31:53,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:53,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:31:53,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:31:53,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:31:53,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:53,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 235 transitions, 2532 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:53,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:53,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:53,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:54,668 INFO L124 PetriNetUnfolderBase]: 1666/3730 cut-off events. [2024-05-12 13:31:54,668 INFO L125 PetriNetUnfolderBase]: For 35282/35282 co-relation queries the response was YES. [2024-05-12 13:31:54,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14521 conditions, 3730 events. 1666/3730 cut-off events. For 35282/35282 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 29810 event pairs, 612 based on Foata normal form. 2/3479 useless extension candidates. Maximal degree in co-relation 14407. Up to 2690 conditions per place. [2024-05-12 13:31:54,700 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 195 selfloop transitions, 54 changer transitions 0/259 dead transitions. [2024-05-12 13:31:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 259 transitions, 3120 flow [2024-05-12 13:31:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:31:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:31:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 13:31:54,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2024-05-12 13:31:54,701 INFO L175 Difference]: Start difference. First operand has 263 places, 235 transitions, 2532 flow. Second operand 10 states and 186 transitions. [2024-05-12 13:31:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 259 transitions, 3120 flow [2024-05-12 13:31:54,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 259 transitions, 2967 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-05-12 13:31:54,934 INFO L231 Difference]: Finished difference. Result has 264 places, 235 transitions, 2491 flow [2024-05-12 13:31:54,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2491, PETRI_PLACES=264, PETRI_TRANSITIONS=235} [2024-05-12 13:31:54,934 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places. [2024-05-12 13:31:54,935 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 235 transitions, 2491 flow [2024-05-12 13:31:54,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:54,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:54,935 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-05-12 13:31:54,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 13:31:54,935 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:54,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:54,936 INFO L85 PathProgramCache]: Analyzing trace with hash 295425970, now seen corresponding path program 4 times [2024-05-12 13:31:54,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:54,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358652289] [2024-05-12 13:31:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358652289] [2024-05-12 13:31:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358652289] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791851958] [2024-05-12 13:31:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:55,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:55,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:55,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:56,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:56,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 235 transitions, 2491 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:56,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:56,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:56,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:56,887 INFO L124 PetriNetUnfolderBase]: 1727/3892 cut-off events. [2024-05-12 13:31:56,887 INFO L125 PetriNetUnfolderBase]: For 49864/49864 co-relation queries the response was YES. [2024-05-12 13:31:56,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14900 conditions, 3892 events. 1727/3892 cut-off events. For 49864/49864 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31545 event pairs, 657 based on Foata normal form. 8/3632 useless extension candidates. Maximal degree in co-relation 14785. Up to 2781 conditions per place. [2024-05-12 13:31:56,926 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 196 selfloop transitions, 56 changer transitions 0/262 dead transitions. [2024-05-12 13:31:56,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 262 transitions, 3123 flow [2024-05-12 13:31:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:31:56,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 13:31:56,932 INFO L175 Difference]: Start difference. First operand has 264 places, 235 transitions, 2491 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:31:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 262 transitions, 3123 flow [2024-05-12 13:31:57,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 262 transitions, 2947 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-05-12 13:31:57,190 INFO L231 Difference]: Finished difference. Result has 266 places, 237 transitions, 2454 flow [2024-05-12 13:31:57,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2315, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2454, PETRI_PLACES=266, PETRI_TRANSITIONS=237} [2024-05-12 13:31:57,191 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 223 predicate places. [2024-05-12 13:31:57,191 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 237 transitions, 2454 flow [2024-05-12 13:31:57,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:57,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:57,191 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-05-12 13:31:57,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 13:31:57,192 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:57,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash -57892942, now seen corresponding path program 5 times [2024-05-12 13:31:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:57,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072290247] [2024-05-12 13:31:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:57,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:31:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:31:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:31:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072290247] [2024-05-12 13:31:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072290247] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:31:58,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:31:58,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:31:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605752260] [2024-05-12 13:31:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:31:58,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:31:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:31:58,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:31:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:31:58,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:31:58,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 237 transitions, 2454 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:58,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:31:58,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:31:58,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:31:59,189 INFO L124 PetriNetUnfolderBase]: 1788/4055 cut-off events. [2024-05-12 13:31:59,189 INFO L125 PetriNetUnfolderBase]: For 50764/50764 co-relation queries the response was YES. [2024-05-12 13:31:59,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15114 conditions, 4055 events. 1788/4055 cut-off events. For 50764/50764 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 33302 event pairs, 699 based on Foata normal form. 8/3784 useless extension candidates. Maximal degree in co-relation 14998. Up to 2901 conditions per place. [2024-05-12 13:31:59,220 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 200 selfloop transitions, 54 changer transitions 0/264 dead transitions. [2024-05-12 13:31:59,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 264 transitions, 3094 flow [2024-05-12 13:31:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:31:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:31:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:31:59,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 13:31:59,221 INFO L175 Difference]: Start difference. First operand has 266 places, 237 transitions, 2454 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:31:59,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 264 transitions, 3094 flow [2024-05-12 13:31:59,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 264 transitions, 2985 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 13:31:59,426 INFO L231 Difference]: Finished difference. Result has 270 places, 239 transitions, 2484 flow [2024-05-12 13:31:59,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2484, PETRI_PLACES=270, PETRI_TRANSITIONS=239} [2024-05-12 13:31:59,427 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 227 predicate places. [2024-05-12 13:31:59,427 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 239 transitions, 2484 flow [2024-05-12 13:31:59,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:31:59,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:31:59,427 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-05-12 13:31:59,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 13:31:59,427 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:31:59,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:31:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2048937906, now seen corresponding path program 6 times [2024-05-12 13:31:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:31:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930259289] [2024-05-12 13:31:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:31:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:31:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:00,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930259289] [2024-05-12 13:32:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930259289] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:00,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:00,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089372506] [2024-05-12 13:32:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:00,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:00,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:00,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 239 transitions, 2484 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:00,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:00,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:00,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:01,361 INFO L124 PetriNetUnfolderBase]: 1926/4378 cut-off events. [2024-05-12 13:32:01,361 INFO L125 PetriNetUnfolderBase]: For 67360/67360 co-relation queries the response was YES. [2024-05-12 13:32:01,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16746 conditions, 4378 events. 1926/4378 cut-off events. For 67360/67360 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36647 event pairs, 762 based on Foata normal form. 6/4095 useless extension candidates. Maximal degree in co-relation 16628. Up to 2849 conditions per place. [2024-05-12 13:32:01,402 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 164 selfloop transitions, 99 changer transitions 0/273 dead transitions. [2024-05-12 13:32:01,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 273 transitions, 3310 flow [2024-05-12 13:32:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:32:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:32:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-05-12 13:32:01,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-05-12 13:32:01,404 INFO L175 Difference]: Start difference. First operand has 270 places, 239 transitions, 2484 flow. Second operand 12 states and 222 transitions. [2024-05-12 13:32:01,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 273 transitions, 3310 flow [2024-05-12 13:32:01,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 273 transitions, 3201 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 13:32:01,717 INFO L231 Difference]: Finished difference. Result has 274 places, 239 transitions, 2576 flow [2024-05-12 13:32:01,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2576, PETRI_PLACES=274, PETRI_TRANSITIONS=239} [2024-05-12 13:32:01,717 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 231 predicate places. [2024-05-12 13:32:01,717 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 239 transitions, 2576 flow [2024-05-12 13:32:01,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:01,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:01,718 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-05-12 13:32:01,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 13:32:01,718 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:01,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2038750686, now seen corresponding path program 7 times [2024-05-12 13:32:01,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:01,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652675531] [2024-05-12 13:32:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:03,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652675531] [2024-05-12 13:32:03,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652675531] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:03,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:03,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669840850] [2024-05-12 13:32:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:03,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:03,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:03,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 239 transitions, 2576 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:03,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:03,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:04,052 INFO L124 PetriNetUnfolderBase]: 1916/4351 cut-off events. [2024-05-12 13:32:04,052 INFO L125 PetriNetUnfolderBase]: For 54412/54412 co-relation queries the response was YES. [2024-05-12 13:32:04,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16269 conditions, 4351 events. 1916/4351 cut-off events. For 54412/54412 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36478 event pairs, 799 based on Foata normal form. 8/4075 useless extension candidates. Maximal degree in co-relation 16150. Up to 3138 conditions per place. [2024-05-12 13:32:04,096 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 195 selfloop transitions, 63 changer transitions 0/268 dead transitions. [2024-05-12 13:32:04,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 268 transitions, 3220 flow [2024-05-12 13:32:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 13:32:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 13:32:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-05-12 13:32:04,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4536489151873767 [2024-05-12 13:32:04,112 INFO L175 Difference]: Start difference. First operand has 274 places, 239 transitions, 2576 flow. Second operand 13 states and 230 transitions. [2024-05-12 13:32:04,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 268 transitions, 3220 flow [2024-05-12 13:32:04,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 268 transitions, 3029 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:32:04,391 INFO L231 Difference]: Finished difference. Result has 278 places, 239 transitions, 2517 flow [2024-05-12 13:32:04,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2385, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2517, PETRI_PLACES=278, PETRI_TRANSITIONS=239} [2024-05-12 13:32:04,392 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 235 predicate places. [2024-05-12 13:32:04,392 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 239 transitions, 2517 flow [2024-05-12 13:32:04,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:04,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:04,392 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-05-12 13:32:04,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 13:32:04,392 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:04,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -47417422, now seen corresponding path program 8 times [2024-05-12 13:32:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:04,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787064067] [2024-05-12 13:32:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:05,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787064067] [2024-05-12 13:32:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787064067] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:05,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:05,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:05,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311849520] [2024-05-12 13:32:05,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:05,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:05,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:05,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 239 transitions, 2517 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:05,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:05,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:05,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:06,357 INFO L124 PetriNetUnfolderBase]: 2017/4635 cut-off events. [2024-05-12 13:32:06,357 INFO L125 PetriNetUnfolderBase]: For 72113/72113 co-relation queries the response was YES. [2024-05-12 13:32:06,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17675 conditions, 4635 events. 2017/4635 cut-off events. For 72113/72113 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 39697 event pairs, 833 based on Foata normal form. 6/4338 useless extension candidates. Maximal degree in co-relation 17555. Up to 2902 conditions per place. [2024-05-12 13:32:06,403 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 174 selfloop transitions, 87 changer transitions 0/271 dead transitions. [2024-05-12 13:32:06,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 271 transitions, 3335 flow [2024-05-12 13:32:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-05-12 13:32:06,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801864801864802 [2024-05-12 13:32:06,405 INFO L175 Difference]: Start difference. First operand has 278 places, 239 transitions, 2517 flow. Second operand 11 states and 206 transitions. [2024-05-12 13:32:06,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 271 transitions, 3335 flow [2024-05-12 13:32:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 271 transitions, 3199 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-05-12 13:32:06,821 INFO L231 Difference]: Finished difference. Result has 277 places, 239 transitions, 2558 flow [2024-05-12 13:32:06,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2381, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2558, PETRI_PLACES=277, PETRI_TRANSITIONS=239} [2024-05-12 13:32:06,822 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 234 predicate places. [2024-05-12 13:32:06,822 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 239 transitions, 2558 flow [2024-05-12 13:32:06,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:06,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:06,822 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-05-12 13:32:06,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 13:32:06,823 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:06,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash 661872468, now seen corresponding path program 9 times [2024-05-12 13:32:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:06,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711482019] [2024-05-12 13:32:06,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711482019] [2024-05-12 13:32:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711482019] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053582465] [2024-05-12 13:32:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:07,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:08,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:08,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 239 transitions, 2558 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:08,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:08,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:08,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:09,172 INFO L124 PetriNetUnfolderBase]: 2118/4913 cut-off events. [2024-05-12 13:32:09,172 INFO L125 PetriNetUnfolderBase]: For 97182/97182 co-relation queries the response was YES. [2024-05-12 13:32:09,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19187 conditions, 4913 events. 2118/4913 cut-off events. For 97182/97182 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 42952 event pairs, 928 based on Foata normal form. 6/4601 useless extension candidates. Maximal degree in co-relation 19066. Up to 3408 conditions per place. [2024-05-12 13:32:09,219 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 195 selfloop transitions, 70 changer transitions 0/275 dead transitions. [2024-05-12 13:32:09,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 275 transitions, 3402 flow [2024-05-12 13:32:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 13:32:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 13:32:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 238 transitions. [2024-05-12 13:32:09,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46942800788954636 [2024-05-12 13:32:09,220 INFO L175 Difference]: Start difference. First operand has 277 places, 239 transitions, 2558 flow. Second operand 13 states and 238 transitions. [2024-05-12 13:32:09,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 275 transitions, 3402 flow [2024-05-12 13:32:09,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 275 transitions, 3229 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:32:09,682 INFO L231 Difference]: Finished difference. Result has 281 places, 239 transitions, 2528 flow [2024-05-12 13:32:09,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2385, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2528, PETRI_PLACES=281, PETRI_TRANSITIONS=239} [2024-05-12 13:32:09,683 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places. [2024-05-12 13:32:09,683 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 239 transitions, 2528 flow [2024-05-12 13:32:09,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:09,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:09,683 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-05-12 13:32:09,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 13:32:09,684 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:09,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 661516278, now seen corresponding path program 10 times [2024-05-12 13:32:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413538939] [2024-05-12 13:32:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:10,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413538939] [2024-05-12 13:32:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413538939] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:10,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865012040] [2024-05-12 13:32:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:10,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:10,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:10,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:10,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 239 transitions, 2528 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:10,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:10,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:12,013 INFO L124 PetriNetUnfolderBase]: 2044/4696 cut-off events. [2024-05-12 13:32:12,014 INFO L125 PetriNetUnfolderBase]: For 59624/59624 co-relation queries the response was YES. [2024-05-12 13:32:12,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17389 conditions, 4696 events. 2044/4696 cut-off events. For 59624/59624 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 40417 event pairs, 899 based on Foata normal form. 8/4403 useless extension candidates. Maximal degree in co-relation 17267. Up to 3255 conditions per place. [2024-05-12 13:32:12,061 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 187 selfloop transitions, 73 changer transitions 0/270 dead transitions. [2024-05-12 13:32:12,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 270 transitions, 3184 flow [2024-05-12 13:32:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-12 13:32:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-05-12 13:32:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 247 transitions. [2024-05-12 13:32:12,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-05-12 13:32:12,062 INFO L175 Difference]: Start difference. First operand has 281 places, 239 transitions, 2528 flow. Second operand 14 states and 247 transitions. [2024-05-12 13:32:12,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 270 transitions, 3184 flow [2024-05-12 13:32:12,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 270 transitions, 3045 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 13:32:12,376 INFO L231 Difference]: Finished difference. Result has 284 places, 239 transitions, 2543 flow [2024-05-12 13:32:12,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2389, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2543, PETRI_PLACES=284, PETRI_TRANSITIONS=239} [2024-05-12 13:32:12,377 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places. [2024-05-12 13:32:12,377 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 239 transitions, 2543 flow [2024-05-12 13:32:12,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:12,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:12,377 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-05-12 13:32:12,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 13:32:12,378 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:12,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -612304920, now seen corresponding path program 11 times [2024-05-12 13:32:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112629829] [2024-05-12 13:32:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:13,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-05-12 13:32:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112629829] [2024-05-12 13:32:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112629829] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601281420] [2024-05-12 13:32:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:13,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:13,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 239 transitions, 2543 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:13,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:13,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:13,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:14,541 INFO L124 PetriNetUnfolderBase]: 2098/4840 cut-off events. [2024-05-12 13:32:14,541 INFO L125 PetriNetUnfolderBase]: For 61540/61540 co-relation queries the response was YES. [2024-05-12 13:32:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17885 conditions, 4840 events. 2098/4840 cut-off events. For 61540/61540 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 42111 event pairs, 941 based on Foata normal form. 8/4535 useless extension candidates. Maximal degree in co-relation 17762. Up to 3506 conditions per place. [2024-05-12 13:32:14,587 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 193 selfloop transitions, 63 changer transitions 0/266 dead transitions. [2024-05-12 13:32:14,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 266 transitions, 3175 flow [2024-05-12 13:32:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:32:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:32:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-05-12 13:32:14,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594017094017094 [2024-05-12 13:32:14,588 INFO L175 Difference]: Start difference. First operand has 284 places, 239 transitions, 2543 flow. Second operand 12 states and 215 transitions. [2024-05-12 13:32:14,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 266 transitions, 3175 flow [2024-05-12 13:32:14,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 266 transitions, 3023 flow, removed 1 selfloop flow, removed 14 redundant places. [2024-05-12 13:32:14,934 INFO L231 Difference]: Finished difference. Result has 282 places, 239 transitions, 2523 flow [2024-05-12 13:32:14,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2523, PETRI_PLACES=282, PETRI_TRANSITIONS=239} [2024-05-12 13:32:14,934 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 239 predicate places. [2024-05-12 13:32:14,934 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 239 transitions, 2523 flow [2024-05-12 13:32:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:14,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:14,935 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-05-12 13:32:14,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 13:32:14,935 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:14,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1047380086, now seen corresponding path program 12 times [2024-05-12 13:32:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676134021] [2024-05-12 13:32:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676134021] [2024-05-12 13:32:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676134021] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:15,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722659931] [2024-05-12 13:32:15,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:15,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:15,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:15,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:15,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 239 transitions, 2523 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:15,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:15,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:15,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:16,974 INFO L124 PetriNetUnfolderBase]: 2152/5029 cut-off events. [2024-05-12 13:32:16,975 INFO L125 PetriNetUnfolderBase]: For 62238/62238 co-relation queries the response was YES. [2024-05-12 13:32:17,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18332 conditions, 5029 events. 2152/5029 cut-off events. For 62238/62238 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 44447 event pairs, 957 based on Foata normal form. 8/4696 useless extension candidates. Maximal degree in co-relation 18209. Up to 3566 conditions per place. [2024-05-12 13:32:17,022 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 162 selfloop transitions, 94 changer transitions 0/266 dead transitions. [2024-05-12 13:32:17,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 266 transitions, 3155 flow [2024-05-12 13:32:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:32:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:32:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2024-05-12 13:32:17,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636752136752137 [2024-05-12 13:32:17,024 INFO L175 Difference]: Start difference. First operand has 282 places, 239 transitions, 2523 flow. Second operand 12 states and 217 transitions. [2024-05-12 13:32:17,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 266 transitions, 3155 flow [2024-05-12 13:32:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 266 transitions, 3025 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-05-12 13:32:17,317 INFO L231 Difference]: Finished difference. Result has 282 places, 239 transitions, 2585 flow [2024-05-12 13:32:17,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2585, PETRI_PLACES=282, PETRI_TRANSITIONS=239} [2024-05-12 13:32:17,317 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 239 predicate places. [2024-05-12 13:32:17,318 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 239 transitions, 2585 flow [2024-05-12 13:32:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:17,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:17,318 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-05-12 13:32:17,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 13:32:17,318 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:17,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -907524120, now seen corresponding path program 13 times [2024-05-12 13:32:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:17,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015648429] [2024-05-12 13:32:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:18,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:18,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015648429] [2024-05-12 13:32:18,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015648429] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:18,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:18,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5724667] [2024-05-12 13:32:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:18,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:18,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:18,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 239 transitions, 2585 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:18,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:18,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:18,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:19,437 INFO L124 PetriNetUnfolderBase]: 2206/5169 cut-off events. [2024-05-12 13:32:19,437 INFO L125 PetriNetUnfolderBase]: For 63166/63166 co-relation queries the response was YES. [2024-05-12 13:32:19,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18844 conditions, 5169 events. 2206/5169 cut-off events. For 63166/63166 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 46109 event pairs, 1015 based on Foata normal form. 8/4837 useless extension candidates. Maximal degree in co-relation 18721. Up to 3732 conditions per place. [2024-05-12 13:32:19,479 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 201 selfloop transitions, 53 changer transitions 0/264 dead transitions. [2024-05-12 13:32:19,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 264 transitions, 3205 flow [2024-05-12 13:32:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-05-12 13:32:19,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662004662004662 [2024-05-12 13:32:19,481 INFO L175 Difference]: Start difference. First operand has 282 places, 239 transitions, 2585 flow. Second operand 11 states and 200 transitions. [2024-05-12 13:32:19,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 264 transitions, 3205 flow [2024-05-12 13:32:19,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 264 transitions, 3019 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:32:19,803 INFO L231 Difference]: Finished difference. Result has 283 places, 239 transitions, 2510 flow [2024-05-12 13:32:19,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2399, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2510, PETRI_PLACES=283, PETRI_TRANSITIONS=239} [2024-05-12 13:32:19,804 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places. [2024-05-12 13:32:19,804 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 239 transitions, 2510 flow [2024-05-12 13:32:19,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:19,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:19,804 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-05-12 13:32:19,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-12 13:32:19,804 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:19,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 496838470, now seen corresponding path program 14 times [2024-05-12 13:32:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663320134] [2024-05-12 13:32:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663320134] [2024-05-12 13:32:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663320134] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:20,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868455221] [2024-05-12 13:32:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:20,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:20,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:21,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:21,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 239 transitions, 2510 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:21,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:21,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:21,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:22,101 INFO L124 PetriNetUnfolderBase]: 2243/5236 cut-off events. [2024-05-12 13:32:22,101 INFO L125 PetriNetUnfolderBase]: For 58523/58523 co-relation queries the response was YES. [2024-05-12 13:32:22,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19034 conditions, 5236 events. 2243/5236 cut-off events. For 58523/58523 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 46643 event pairs, 1012 based on Foata normal form. 6/4923 useless extension candidates. Maximal degree in co-relation 18910. Up to 2660 conditions per place. [2024-05-12 13:32:22,151 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 199 selfloop transitions, 70 changer transitions 0/279 dead transitions. [2024-05-12 13:32:22,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 279 transitions, 3233 flow [2024-05-12 13:32:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 13:32:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 13:32:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 240 transitions. [2024-05-12 13:32:22,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47337278106508873 [2024-05-12 13:32:22,153 INFO L175 Difference]: Start difference. First operand has 283 places, 239 transitions, 2510 flow. Second operand 13 states and 240 transitions. [2024-05-12 13:32:22,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 279 transitions, 3233 flow [2024-05-12 13:32:22,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 3098 flow, removed 6 selfloop flow, removed 13 redundant places. [2024-05-12 13:32:22,423 INFO L231 Difference]: Finished difference. Result has 283 places, 239 transitions, 2518 flow [2024-05-12 13:32:22,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2518, PETRI_PLACES=283, PETRI_TRANSITIONS=239} [2024-05-12 13:32:22,423 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places. [2024-05-12 13:32:22,424 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 239 transitions, 2518 flow [2024-05-12 13:32:22,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:22,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:22,424 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-05-12 13:32:22,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-12 13:32:22,424 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:22,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1334257186, now seen corresponding path program 15 times [2024-05-12 13:32:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:22,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393898201] [2024-05-12 13:32:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:23,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:23,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393898201] [2024-05-12 13:32:23,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393898201] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:23,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:32:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706055297] [2024-05-12 13:32:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:23,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:32:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:23,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:32:23,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:32:23,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:23,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 239 transitions, 2518 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:23,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:23,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:23,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:24,826 INFO L124 PetriNetUnfolderBase]: 2260/5294 cut-off events. [2024-05-12 13:32:24,827 INFO L125 PetriNetUnfolderBase]: For 52790/52790 co-relation queries the response was YES. [2024-05-12 13:32:24,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19023 conditions, 5294 events. 2260/5294 cut-off events. For 52790/52790 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 47549 event pairs, 1050 based on Foata normal form. 6/4963 useless extension candidates. Maximal degree in co-relation 18902. Up to 3644 conditions per place. [2024-05-12 13:32:24,879 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 203 selfloop transitions, 59 changer transitions 0/272 dead transitions. [2024-05-12 13:32:24,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 272 transitions, 3198 flow [2024-05-12 13:32:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:32:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:32:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2024-05-12 13:32:24,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 13:32:24,880 INFO L175 Difference]: Start difference. First operand has 283 places, 239 transitions, 2518 flow. Second operand 12 states and 221 transitions. [2024-05-12 13:32:24,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 272 transitions, 3198 flow [2024-05-12 13:32:25,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 272 transitions, 3059 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 13:32:25,202 INFO L231 Difference]: Finished difference. Result has 284 places, 239 transitions, 2500 flow [2024-05-12 13:32:25,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2500, PETRI_PLACES=284, PETRI_TRANSITIONS=239} [2024-05-12 13:32:25,203 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places. [2024-05-12 13:32:25,203 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 239 transitions, 2500 flow [2024-05-12 13:32:25,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:25,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:25,204 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] [2024-05-12 13:32:25,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-05-12 13:32:25,204 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:25,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 237204181, now seen corresponding path program 1 times [2024-05-12 13:32:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766828706] [2024-05-12 13:32:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766828706] [2024-05-12 13:32:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766828706] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447110027] [2024-05-12 13:32:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:26,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:26,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:26,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 239 transitions, 2500 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:26,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:26,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:26,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:27,337 INFO L124 PetriNetUnfolderBase]: 2314/5460 cut-off events. [2024-05-12 13:32:27,338 INFO L125 PetriNetUnfolderBase]: For 54479/54479 co-relation queries the response was YES. [2024-05-12 13:32:27,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19376 conditions, 5460 events. 2314/5460 cut-off events. For 54479/54479 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 49688 event pairs, 1086 based on Foata normal form. 6/5111 useless extension candidates. Maximal degree in co-relation 19254. Up to 4149 conditions per place. [2024-05-12 13:32:27,396 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 214 selfloop transitions, 44 changer transitions 0/268 dead transitions. [2024-05-12 13:32:27,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 268 transitions, 3127 flow [2024-05-12 13:32:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:32:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:32:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-05-12 13:32:27,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4337606837606838 [2024-05-12 13:32:27,397 INFO L175 Difference]: Start difference. First operand has 284 places, 239 transitions, 2500 flow. Second operand 12 states and 203 transitions. [2024-05-12 13:32:27,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 268 transitions, 3127 flow [2024-05-12 13:32:27,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 268 transitions, 3010 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:32:27,721 INFO L231 Difference]: Finished difference. Result has 287 places, 240 transitions, 2486 flow [2024-05-12 13:32:27,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2383, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2486, PETRI_PLACES=287, PETRI_TRANSITIONS=240} [2024-05-12 13:32:27,722 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 244 predicate places. [2024-05-12 13:32:27,722 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 240 transitions, 2486 flow [2024-05-12 13:32:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:27,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:27,722 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] [2024-05-12 13:32:27,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-05-12 13:32:27,722 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:27,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:27,723 INFO L85 PathProgramCache]: Analyzing trace with hash 229852531, now seen corresponding path program 2 times [2024-05-12 13:32:27,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547005774] [2024-05-12 13:32:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:28,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:28,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547005774] [2024-05-12 13:32:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547005774] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:28,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:28,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740162614] [2024-05-12 13:32:28,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:28,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:28,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:28,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:28,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:28,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 240 transitions, 2486 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:28,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:28,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:28,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:29,709 INFO L124 PetriNetUnfolderBase]: 2368/5575 cut-off events. [2024-05-12 13:32:29,709 INFO L125 PetriNetUnfolderBase]: For 55514/55514 co-relation queries the response was YES. [2024-05-12 13:32:29,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19657 conditions, 5575 events. 2368/5575 cut-off events. For 55514/55514 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 50858 event pairs, 1095 based on Foata normal form. 6/5222 useless extension candidates. Maximal degree in co-relation 19533. Up to 4035 conditions per place. [2024-05-12 13:32:29,767 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 190 selfloop transitions, 72 changer transitions 0/272 dead transitions. [2024-05-12 13:32:29,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 272 transitions, 3136 flow [2024-05-12 13:32:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:32:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:32:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 13:32:29,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2024-05-12 13:32:29,769 INFO L175 Difference]: Start difference. First operand has 287 places, 240 transitions, 2486 flow. Second operand 10 states and 189 transitions. [2024-05-12 13:32:29,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 272 transitions, 3136 flow [2024-05-12 13:32:30,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 272 transitions, 3050 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 13:32:30,160 INFO L231 Difference]: Finished difference. Result has 290 places, 242 transitions, 2578 flow [2024-05-12 13:32:30,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2400, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2578, PETRI_PLACES=290, PETRI_TRANSITIONS=242} [2024-05-12 13:32:30,160 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 247 predicate places. [2024-05-12 13:32:30,160 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 242 transitions, 2578 flow [2024-05-12 13:32:30,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:30,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:30,161 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] [2024-05-12 13:32:30,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-05-12 13:32:30,161 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:30,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash 893048071, now seen corresponding path program 3 times [2024-05-12 13:32:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:30,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870231076] [2024-05-12 13:32:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870231076] [2024-05-12 13:32:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870231076] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201945787] [2024-05-12 13:32:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:31,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:31,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:31,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 242 transitions, 2578 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:31,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:31,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:31,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:32,304 INFO L124 PetriNetUnfolderBase]: 2405/5646 cut-off events. [2024-05-12 13:32:32,305 INFO L125 PetriNetUnfolderBase]: For 57194/57194 co-relation queries the response was YES. [2024-05-12 13:32:32,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20130 conditions, 5646 events. 2405/5646 cut-off events. For 57194/57194 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 51449 event pairs, 1093 based on Foata normal form. 6/5328 useless extension candidates. Maximal degree in co-relation 20003. Up to 4185 conditions per place. [2024-05-12 13:32:32,366 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 244 selfloop transitions, 29 changer transitions 0/283 dead transitions. [2024-05-12 13:32:32,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 283 transitions, 3274 flow [2024-05-12 13:32:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:32:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:32:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 13:32:32,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2024-05-12 13:32:32,368 INFO L175 Difference]: Start difference. First operand has 290 places, 242 transitions, 2578 flow. Second operand 10 states and 186 transitions. [2024-05-12 13:32:32,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 283 transitions, 3274 flow [2024-05-12 13:32:32,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 283 transitions, 3140 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 13:32:32,841 INFO L231 Difference]: Finished difference. Result has 294 places, 242 transitions, 2506 flow [2024-05-12 13:32:32,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2506, PETRI_PLACES=294, PETRI_TRANSITIONS=242} [2024-05-12 13:32:32,842 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 251 predicate places. [2024-05-12 13:32:32,842 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 242 transitions, 2506 flow [2024-05-12 13:32:32,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:32,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:32,842 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] [2024-05-12 13:32:32,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-05-12 13:32:32,843 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:32,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash -395402483, now seen corresponding path program 4 times [2024-05-12 13:32:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749586874] [2024-05-12 13:32:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749586874] [2024-05-12 13:32:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749586874] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186267439] [2024-05-12 13:32:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:33,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:34,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:34,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 242 transitions, 2506 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:34,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:34,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:34,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:35,147 INFO L124 PetriNetUnfolderBase]: 2459/5784 cut-off events. [2024-05-12 13:32:35,148 INFO L125 PetriNetUnfolderBase]: For 58035/58035 co-relation queries the response was YES. [2024-05-12 13:32:35,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20379 conditions, 5784 events. 2459/5784 cut-off events. For 58035/58035 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 53186 event pairs, 1150 based on Foata normal form. 6/5427 useless extension candidates. Maximal degree in co-relation 20251. Up to 4073 conditions per place. [2024-05-12 13:32:35,210 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 196 selfloop transitions, 71 changer transitions 0/277 dead transitions. [2024-05-12 13:32:35,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 277 transitions, 3171 flow [2024-05-12 13:32:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:32:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:32:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-05-12 13:32:35,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2024-05-12 13:32:35,212 INFO L175 Difference]: Start difference. First operand has 294 places, 242 transitions, 2506 flow. Second operand 10 states and 192 transitions. [2024-05-12 13:32:35,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 277 transitions, 3171 flow [2024-05-12 13:32:35,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 277 transitions, 2940 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-05-12 13:32:35,599 INFO L231 Difference]: Finished difference. Result has 297 places, 243 transitions, 2430 flow [2024-05-12 13:32:35,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2430, PETRI_PLACES=297, PETRI_TRANSITIONS=243} [2024-05-12 13:32:35,600 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 254 predicate places. [2024-05-12 13:32:35,600 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 243 transitions, 2430 flow [2024-05-12 13:32:35,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:35,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:35,600 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] [2024-05-12 13:32:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-05-12 13:32:35,601 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:35,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1392210517, now seen corresponding path program 5 times [2024-05-12 13:32:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196730440] [2024-05-12 13:32:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:36,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196730440] [2024-05-12 13:32:36,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196730440] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:36,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238396236] [2024-05-12 13:32:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:36,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:36,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:36,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:36,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:36,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 243 transitions, 2430 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:36,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:36,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:36,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:37,844 INFO L124 PetriNetUnfolderBase]: 2496/5865 cut-off events. [2024-05-12 13:32:37,844 INFO L125 PetriNetUnfolderBase]: For 58943/58943 co-relation queries the response was YES. [2024-05-12 13:32:37,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20023 conditions, 5865 events. 2496/5865 cut-off events. For 58943/58943 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 54144 event pairs, 1159 based on Foata normal form. 6/5527 useless extension candidates. Maximal degree in co-relation 19896. Up to 3200 conditions per place. [2024-05-12 13:32:37,910 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 181 selfloop transitions, 90 changer transitions 0/281 dead transitions. [2024-05-12 13:32:37,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 281 transitions, 3112 flow [2024-05-12 13:32:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:32:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:32:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-05-12 13:32:37,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2024-05-12 13:32:37,912 INFO L175 Difference]: Start difference. First operand has 297 places, 243 transitions, 2430 flow. Second operand 10 states and 192 transitions. [2024-05-12 13:32:37,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 281 transitions, 3112 flow [2024-05-12 13:32:38,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 281 transitions, 2931 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-05-12 13:32:38,305 INFO L231 Difference]: Finished difference. Result has 298 places, 243 transitions, 2432 flow [2024-05-12 13:32:38,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2432, PETRI_PLACES=298, PETRI_TRANSITIONS=243} [2024-05-12 13:32:38,306 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 255 predicate places. [2024-05-12 13:32:38,306 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 243 transitions, 2432 flow [2024-05-12 13:32:38,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:38,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:38,306 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] [2024-05-12 13:32:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-05-12 13:32:38,306 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:38,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2019921485, now seen corresponding path program 6 times [2024-05-12 13:32:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21982234] [2024-05-12 13:32:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21982234] [2024-05-12 13:32:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21982234] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331830650] [2024-05-12 13:32:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:39,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:39,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:39,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:39,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 243 transitions, 2432 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:39,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:39,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:39,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:40,571 INFO L124 PetriNetUnfolderBase]: 2596/6099 cut-off events. [2024-05-12 13:32:40,571 INFO L125 PetriNetUnfolderBase]: For 54955/54955 co-relation queries the response was YES. [2024-05-12 13:32:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20155 conditions, 6099 events. 2596/6099 cut-off events. For 54955/54955 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 56696 event pairs, 1293 based on Foata normal form. 6/5725 useless extension candidates. Maximal degree in co-relation 20029. Up to 4418 conditions per place. [2024-05-12 13:32:40,636 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 176 selfloop transitions, 96 changer transitions 0/282 dead transitions. [2024-05-12 13:32:40,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 282 transitions, 3166 flow [2024-05-12 13:32:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-05-12 13:32:40,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47785547785547783 [2024-05-12 13:32:40,637 INFO L175 Difference]: Start difference. First operand has 298 places, 243 transitions, 2432 flow. Second operand 11 states and 205 transitions. [2024-05-12 13:32:40,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 282 transitions, 3166 flow [2024-05-12 13:32:41,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 282 transitions, 2977 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 13:32:41,097 INFO L231 Difference]: Finished difference. Result has 303 places, 249 transitions, 2516 flow [2024-05-12 13:32:41,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2516, PETRI_PLACES=303, PETRI_TRANSITIONS=249} [2024-05-12 13:32:41,097 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 260 predicate places. [2024-05-12 13:32:41,098 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 249 transitions, 2516 flow [2024-05-12 13:32:41,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:41,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:41,098 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] [2024-05-12 13:32:41,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-05-12 13:32:41,098 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:41,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1332025109, now seen corresponding path program 7 times [2024-05-12 13:32:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:41,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610878581] [2024-05-12 13:32:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:42,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610878581] [2024-05-12 13:32:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610878581] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:42,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:42,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940564568] [2024-05-12 13:32:42,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:42,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:42,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:42,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:42,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:42,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 249 transitions, 2516 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:42,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:42,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:43,548 INFO L124 PetriNetUnfolderBase]: 2690/6308 cut-off events. [2024-05-12 13:32:43,548 INFO L125 PetriNetUnfolderBase]: For 55925/55925 co-relation queries the response was YES. [2024-05-12 13:32:43,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20686 conditions, 6308 events. 2690/6308 cut-off events. For 55925/55925 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 59000 event pairs, 1368 based on Foata normal form. 6/5931 useless extension candidates. Maximal degree in co-relation 20557. Up to 4613 conditions per place. [2024-05-12 13:32:43,621 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 218 selfloop transitions, 63 changer transitions 0/291 dead transitions. [2024-05-12 13:32:43,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 291 transitions, 3271 flow [2024-05-12 13:32:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-05-12 13:32:43,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801864801864802 [2024-05-12 13:32:43,623 INFO L175 Difference]: Start difference. First operand has 303 places, 249 transitions, 2516 flow. Second operand 11 states and 206 transitions. [2024-05-12 13:32:43,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 291 transitions, 3271 flow [2024-05-12 13:32:44,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 291 transitions, 3108 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 13:32:44,116 INFO L231 Difference]: Finished difference. Result has 311 places, 254 transitions, 2547 flow [2024-05-12 13:32:44,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2547, PETRI_PLACES=311, PETRI_TRANSITIONS=254} [2024-05-12 13:32:44,117 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 268 predicate places. [2024-05-12 13:32:44,117 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 254 transitions, 2547 flow [2024-05-12 13:32:44,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:44,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:44,117 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] [2024-05-12 13:32:44,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-05-12 13:32:44,117 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:44,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 397252163, now seen corresponding path program 8 times [2024-05-12 13:32:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91886017] [2024-05-12 13:32:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91886017] [2024-05-12 13:32:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91886017] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832163723] [2024-05-12 13:32:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:45,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:45,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 254 transitions, 2547 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:45,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:45,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:45,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:46,494 INFO L124 PetriNetUnfolderBase]: 2727/6402 cut-off events. [2024-05-12 13:32:46,494 INFO L125 PetriNetUnfolderBase]: For 57358/57358 co-relation queries the response was YES. [2024-05-12 13:32:46,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20970 conditions, 6402 events. 2727/6402 cut-off events. For 57358/57358 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 60043 event pairs, 1430 based on Foata normal form. 6/6021 useless extension candidates. Maximal degree in co-relation 20838. Up to 4775 conditions per place. [2024-05-12 13:32:46,568 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 216 selfloop transitions, 62 changer transitions 0/288 dead transitions. [2024-05-12 13:32:46,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 288 transitions, 3237 flow [2024-05-12 13:32:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-05-12 13:32:46,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47785547785547783 [2024-05-12 13:32:46,569 INFO L175 Difference]: Start difference. First operand has 311 places, 254 transitions, 2547 flow. Second operand 11 states and 205 transitions. [2024-05-12 13:32:46,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 288 transitions, 3237 flow [2024-05-12 13:32:47,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 288 transitions, 3147 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-05-12 13:32:47,051 INFO L231 Difference]: Finished difference. Result has 317 places, 255 transitions, 2604 flow [2024-05-12 13:32:47,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2457, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2604, PETRI_PLACES=317, PETRI_TRANSITIONS=255} [2024-05-12 13:32:47,052 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-05-12 13:32:47,052 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 255 transitions, 2604 flow [2024-05-12 13:32:47,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:47,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:47,052 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] [2024-05-12 13:32:47,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-05-12 13:32:47,053 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:47,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash 268700143, now seen corresponding path program 9 times [2024-05-12 13:32:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745705051] [2024-05-12 13:32:47,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745705051] [2024-05-12 13:32:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745705051] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711292793] [2024-05-12 13:32:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:48,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:48,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:48,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:48,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 255 transitions, 2604 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:48,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:48,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:48,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:49,502 INFO L124 PetriNetUnfolderBase]: 2764/6482 cut-off events. [2024-05-12 13:32:49,503 INFO L125 PetriNetUnfolderBase]: For 58891/58891 co-relation queries the response was YES. [2024-05-12 13:32:49,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21175 conditions, 6482 events. 2764/6482 cut-off events. For 58891/58891 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 60913 event pairs, 1426 based on Foata normal form. 6/6104 useless extension candidates. Maximal degree in co-relation 21042. Up to 4677 conditions per place. [2024-05-12 13:32:49,578 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 215 selfloop transitions, 66 changer transitions 0/291 dead transitions. [2024-05-12 13:32:49,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 291 transitions, 3300 flow [2024-05-12 13:32:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-05-12 13:32:49,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-05-12 13:32:49,579 INFO L175 Difference]: Start difference. First operand has 317 places, 255 transitions, 2604 flow. Second operand 11 states and 208 transitions. [2024-05-12 13:32:49,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 291 transitions, 3300 flow [2024-05-12 13:32:50,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 291 transitions, 3112 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-05-12 13:32:50,039 INFO L231 Difference]: Finished difference. Result has 317 places, 255 transitions, 2551 flow [2024-05-12 13:32:50,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2551, PETRI_PLACES=317, PETRI_TRANSITIONS=255} [2024-05-12 13:32:50,039 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-05-12 13:32:50,040 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 255 transitions, 2551 flow [2024-05-12 13:32:50,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:50,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:50,040 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] [2024-05-12 13:32:50,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-05-12 13:32:50,040 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:50,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1408137259, now seen corresponding path program 10 times [2024-05-12 13:32:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017749481] [2024-05-12 13:32:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:51,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:51,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017749481] [2024-05-12 13:32:51,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017749481] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:51,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214763583] [2024-05-12 13:32:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:51,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:51,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:51,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:51,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 255 transitions, 2551 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:51,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:51,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:51,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:52,374 INFO L124 PetriNetUnfolderBase]: 2801/6582 cut-off events. [2024-05-12 13:32:52,375 INFO L125 PetriNetUnfolderBase]: For 59189/59189 co-relation queries the response was YES. [2024-05-12 13:32:52,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21209 conditions, 6582 events. 2801/6582 cut-off events. For 59189/59189 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 62109 event pairs, 1508 based on Foata normal form. 6/6195 useless extension candidates. Maximal degree in co-relation 21080. Up to 4933 conditions per place. [2024-05-12 13:32:52,444 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 215 selfloop transitions, 62 changer transitions 0/287 dead transitions. [2024-05-12 13:32:52,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 287 transitions, 3225 flow [2024-05-12 13:32:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-05-12 13:32:52,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46853146853146854 [2024-05-12 13:32:52,445 INFO L175 Difference]: Start difference. First operand has 317 places, 255 transitions, 2551 flow. Second operand 11 states and 201 transitions. [2024-05-12 13:32:52,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 287 transitions, 3225 flow [2024-05-12 13:32:52,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 287 transitions, 3080 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-05-12 13:32:53,012 INFO L231 Difference]: Finished difference. Result has 317 places, 255 transitions, 2533 flow [2024-05-12 13:32:53,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2533, PETRI_PLACES=317, PETRI_TRANSITIONS=255} [2024-05-12 13:32:53,013 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-05-12 13:32:53,013 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 255 transitions, 2533 flow [2024-05-12 13:32:53,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:53,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:53,013 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] [2024-05-12 13:32:53,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-05-12 13:32:53,014 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:53,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash -859248363, now seen corresponding path program 11 times [2024-05-12 13:32:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338741705] [2024-05-12 13:32:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:54,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:54,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338741705] [2024-05-12 13:32:54,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338741705] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:54,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:54,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:54,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987602352] [2024-05-12 13:32:54,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:54,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:54,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:54,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:54,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:54,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 255 transitions, 2533 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:54,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:54,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:54,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:55,444 INFO L124 PetriNetUnfolderBase]: 2838/6653 cut-off events. [2024-05-12 13:32:55,445 INFO L125 PetriNetUnfolderBase]: For 60058/60058 co-relation queries the response was YES. [2024-05-12 13:32:55,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21277 conditions, 6653 events. 2838/6653 cut-off events. For 60058/60058 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 62947 event pairs, 1484 based on Foata normal form. 6/6271 useless extension candidates. Maximal degree in co-relation 21149. Up to 4621 conditions per place. [2024-05-12 13:32:55,509 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 185 selfloop transitions, 96 changer transitions 0/291 dead transitions. [2024-05-12 13:32:55,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 291 transitions, 3229 flow [2024-05-12 13:32:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-05-12 13:32:55,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48951048951048953 [2024-05-12 13:32:55,510 INFO L175 Difference]: Start difference. First operand has 317 places, 255 transitions, 2533 flow. Second operand 11 states and 210 transitions. [2024-05-12 13:32:55,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 291 transitions, 3229 flow [2024-05-12 13:32:56,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 291 transitions, 3053 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-05-12 13:32:56,053 INFO L231 Difference]: Finished difference. Result has 317 places, 255 transitions, 2552 flow [2024-05-12 13:32:56,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2552, PETRI_PLACES=317, PETRI_TRANSITIONS=255} [2024-05-12 13:32:56,054 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-05-12 13:32:56,054 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 255 transitions, 2552 flow [2024-05-12 13:32:56,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:56,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:56,054 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] [2024-05-12 13:32:56,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-05-12 13:32:56,055 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:56,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1224477881, now seen corresponding path program 12 times [2024-05-12 13:32:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149885114] [2024-05-12 13:32:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:32:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:32:57,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:32:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149885114] [2024-05-12 13:32:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149885114] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:32:57,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:32:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:32:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856027172] [2024-05-12 13:32:57,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:32:57,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:32:57,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:32:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:32:57,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:32:57,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:32:57,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 255 transitions, 2552 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:57,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:32:57,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:32:57,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:32:58,586 INFO L124 PetriNetUnfolderBase]: 2875/6753 cut-off events. [2024-05-12 13:32:58,586 INFO L125 PetriNetUnfolderBase]: For 61332/61332 co-relation queries the response was YES. [2024-05-12 13:32:58,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21623 conditions, 6753 events. 2875/6753 cut-off events. For 61332/61332 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 64165 event pairs, 1556 based on Foata normal form. 6/6357 useless extension candidates. Maximal degree in co-relation 21496. Up to 5013 conditions per place. [2024-05-12 13:32:58,660 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 190 selfloop transitions, 87 changer transitions 0/287 dead transitions. [2024-05-12 13:32:58,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 287 transitions, 3226 flow [2024-05-12 13:32:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:32:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:32:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-05-12 13:32:58,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801864801864802 [2024-05-12 13:32:58,661 INFO L175 Difference]: Start difference. First operand has 317 places, 255 transitions, 2552 flow. Second operand 11 states and 206 transitions. [2024-05-12 13:32:58,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 287 transitions, 3226 flow [2024-05-12 13:32:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 287 transitions, 3035 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:32:59,171 INFO L231 Difference]: Finished difference. Result has 319 places, 255 transitions, 2538 flow [2024-05-12 13:32:59,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2361, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2538, PETRI_PLACES=319, PETRI_TRANSITIONS=255} [2024-05-12 13:32:59,172 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 276 predicate places. [2024-05-12 13:32:59,172 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 255 transitions, 2538 flow [2024-05-12 13:32:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:32:59,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:32:59,172 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] [2024-05-12 13:32:59,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-05-12 13:32:59,173 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:32:59,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:32:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 247393349, now seen corresponding path program 13 times [2024-05-12 13:32:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:32:59,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952220066] [2024-05-12 13:32:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:32:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:32:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:00,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-05-12 13:33:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952220066] [2024-05-12 13:33:00,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952220066] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:00,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:33:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126383173] [2024-05-12 13:33:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:00,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:33:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:00,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:33:00,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:33:00,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:00,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 255 transitions, 2538 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:00,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:00,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:00,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:01,708 INFO L124 PetriNetUnfolderBase]: 2912/6845 cut-off events. [2024-05-12 13:33:01,708 INFO L125 PetriNetUnfolderBase]: For 62273/62273 co-relation queries the response was YES. [2024-05-12 13:33:01,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21737 conditions, 6845 events. 2912/6845 cut-off events. For 62273/62273 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 65153 event pairs, 1638 based on Foata normal form. 6/6451 useless extension candidates. Maximal degree in co-relation 21609. Up to 5222 conditions per place. [2024-05-12 13:33:01,778 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 213 selfloop transitions, 60 changer transitions 0/283 dead transitions. [2024-05-12 13:33:01,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 283 transitions, 3190 flow [2024-05-12 13:33:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:33:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:33:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-05-12 13:33:01,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662004662004662 [2024-05-12 13:33:01,780 INFO L175 Difference]: Start difference. First operand has 319 places, 255 transitions, 2538 flow. Second operand 11 states and 200 transitions. [2024-05-12 13:33:01,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 283 transitions, 3190 flow [2024-05-12 13:33:02,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 283 transitions, 3017 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:33:02,355 INFO L231 Difference]: Finished difference. Result has 321 places, 255 transitions, 2488 flow [2024-05-12 13:33:02,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2365, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2488, PETRI_PLACES=321, PETRI_TRANSITIONS=255} [2024-05-12 13:33:02,355 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 278 predicate places. [2024-05-12 13:33:02,356 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 255 transitions, 2488 flow [2024-05-12 13:33:02,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:02,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:02,356 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] [2024-05-12 13:33:02,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-05-12 13:33:02,356 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:02,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1222194333, now seen corresponding path program 14 times [2024-05-12 13:33:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:02,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417504813] [2024-05-12 13:33:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417504813] [2024-05-12 13:33:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417504813] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:03,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:03,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:33:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285752170] [2024-05-12 13:33:03,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:03,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:33:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:03,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:33:03,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:33:03,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:03,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 255 transitions, 2488 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:03,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:03,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:03,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:04,555 INFO L124 PetriNetUnfolderBase]: 2949/6933 cut-off events. [2024-05-12 13:33:04,556 INFO L125 PetriNetUnfolderBase]: For 63059/63059 co-relation queries the response was YES. [2024-05-12 13:33:04,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21880 conditions, 6933 events. 2949/6933 cut-off events. For 63059/63059 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 66133 event pairs, 1667 based on Foata normal form. 6/6536 useless extension candidates. Maximal degree in co-relation 21751. Up to 5301 conditions per place. [2024-05-12 13:33:04,625 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 215 selfloop transitions, 58 changer transitions 0/283 dead transitions. [2024-05-12 13:33:04,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 283 transitions, 3140 flow [2024-05-12 13:33:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:33:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:33:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-05-12 13:33:04,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662004662004662 [2024-05-12 13:33:04,626 INFO L175 Difference]: Start difference. First operand has 321 places, 255 transitions, 2488 flow. Second operand 11 states and 200 transitions. [2024-05-12 13:33:04,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 283 transitions, 3140 flow [2024-05-12 13:33:05,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 283 transitions, 3021 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:33:05,166 INFO L231 Difference]: Finished difference. Result has 323 places, 255 transitions, 2488 flow [2024-05-12 13:33:05,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2488, PETRI_PLACES=323, PETRI_TRANSITIONS=255} [2024-05-12 13:33:05,167 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 280 predicate places. [2024-05-12 13:33:05,167 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 255 transitions, 2488 flow [2024-05-12 13:33:05,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:05,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:05,167 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] [2024-05-12 13:33:05,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-05-12 13:33:05,168 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:05,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1023907665, now seen corresponding path program 15 times [2024-05-12 13:33:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:05,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70384772] [2024-05-12 13:33:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:06,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70384772] [2024-05-12 13:33:06,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70384772] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:06,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:06,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:33:06,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360027437] [2024-05-12 13:33:06,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:06,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:33:06,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:33:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:33:06,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:06,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 255 transitions, 2488 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:06,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:06,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:07,519 INFO L124 PetriNetUnfolderBase]: 2986/7018 cut-off events. [2024-05-12 13:33:07,520 INFO L125 PetriNetUnfolderBase]: For 64210/64210 co-relation queries the response was YES. [2024-05-12 13:33:07,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22114 conditions, 7018 events. 2986/7018 cut-off events. For 64210/64210 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 67171 event pairs, 1683 based on Foata normal form. 6/6621 useless extension candidates. Maximal degree in co-relation 21984. Up to 5307 conditions per place. [2024-05-12 13:33:07,596 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 218 selfloop transitions, 59 changer transitions 0/287 dead transitions. [2024-05-12 13:33:07,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 287 transitions, 3162 flow [2024-05-12 13:33:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:33:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:33:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-05-12 13:33:07,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47785547785547783 [2024-05-12 13:33:07,598 INFO L175 Difference]: Start difference. First operand has 323 places, 255 transitions, 2488 flow. Second operand 11 states and 205 transitions. [2024-05-12 13:33:07,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 287 transitions, 3162 flow [2024-05-12 13:33:08,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 287 transitions, 3047 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:33:08,205 INFO L231 Difference]: Finished difference. Result has 325 places, 255 transitions, 2494 flow [2024-05-12 13:33:08,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2373, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2494, PETRI_PLACES=325, PETRI_TRANSITIONS=255} [2024-05-12 13:33:08,206 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 282 predicate places. [2024-05-12 13:33:08,206 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 255 transitions, 2494 flow [2024-05-12 13:33:08,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:08,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:08,206 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] [2024-05-12 13:33:08,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-05-12 13:33:08,207 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:08,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 136511081, now seen corresponding path program 16 times [2024-05-12 13:33:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:08,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871867149] [2024-05-12 13:33:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871867149] [2024-05-12 13:33:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871867149] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:09,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:33:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589572257] [2024-05-12 13:33:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:33:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:33:09,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:33:09,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:09,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 255 transitions, 2494 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:09,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:09,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:09,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:10,901 INFO L124 PetriNetUnfolderBase]: 3023/7106 cut-off events. [2024-05-12 13:33:10,902 INFO L125 PetriNetUnfolderBase]: For 65447/65447 co-relation queries the response was YES. [2024-05-12 13:33:10,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22395 conditions, 7106 events. 3023/7106 cut-off events. For 65447/65447 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 68153 event pairs, 1755 based on Foata normal form. 6/6706 useless extension candidates. Maximal degree in co-relation 22264. Up to 5459 conditions per place. [2024-05-12 13:33:10,997 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 213 selfloop transitions, 62 changer transitions 0/285 dead transitions. [2024-05-12 13:33:10,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 285 transitions, 3158 flow [2024-05-12 13:33:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:33:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:33:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2024-05-12 13:33:10,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636752136752137 [2024-05-12 13:33:10,999 INFO L175 Difference]: Start difference. First operand has 325 places, 255 transitions, 2494 flow. Second operand 12 states and 217 transitions. [2024-05-12 13:33:10,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 285 transitions, 3158 flow [2024-05-12 13:33:11,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 285 transitions, 3041 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:33:11,498 INFO L231 Difference]: Finished difference. Result has 328 places, 255 transitions, 2504 flow [2024-05-12 13:33:11,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2504, PETRI_PLACES=328, PETRI_TRANSITIONS=255} [2024-05-12 13:33:11,499 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places. [2024-05-12 13:33:11,499 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 255 transitions, 2504 flow [2024-05-12 13:33:11,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:11,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:11,499 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] [2024-05-12 13:33:11,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-05-12 13:33:11,500 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:11,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash -111650297, now seen corresponding path program 17 times [2024-05-12 13:33:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573337954] [2024-05-12 13:33:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573337954] [2024-05-12 13:33:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573337954] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:33:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469643362] [2024-05-12 13:33:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:12,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:33:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:33:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:33:12,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:12,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 255 transitions, 2504 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:12,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:12,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:12,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:14,042 INFO L124 PetriNetUnfolderBase]: 3060/7191 cut-off events. [2024-05-12 13:33:14,042 INFO L125 PetriNetUnfolderBase]: For 66598/66598 co-relation queries the response was YES. [2024-05-12 13:33:14,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22617 conditions, 7191 events. 3060/7191 cut-off events. For 66598/66598 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 69203 event pairs, 1764 based on Foata normal form. 6/6783 useless extension candidates. Maximal degree in co-relation 22485. Up to 5460 conditions per place. [2024-05-12 13:33:14,122 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 177 selfloop transitions, 98 changer transitions 0/285 dead transitions. [2024-05-12 13:33:14,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 285 transitions, 3168 flow [2024-05-12 13:33:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:33:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:33:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2024-05-12 13:33:14,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636752136752137 [2024-05-12 13:33:14,123 INFO L175 Difference]: Start difference. First operand has 328 places, 255 transitions, 2504 flow. Second operand 12 states and 217 transitions. [2024-05-12 13:33:14,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 285 transitions, 3168 flow [2024-05-12 13:33:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 285 transitions, 3045 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:33:14,683 INFO L231 Difference]: Finished difference. Result has 330 places, 255 transitions, 2580 flow [2024-05-12 13:33:14,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2381, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2580, PETRI_PLACES=330, PETRI_TRANSITIONS=255} [2024-05-12 13:33:14,683 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 287 predicate places. [2024-05-12 13:33:14,683 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 255 transitions, 2580 flow [2024-05-12 13:33:14,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:14,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:14,684 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] [2024-05-12 13:33:14,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-05-12 13:33:14,684 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:14,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash -119001947, now seen corresponding path program 18 times [2024-05-12 13:33:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209507596] [2024-05-12 13:33:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209507596] [2024-05-12 13:33:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209507596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:15,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 13:33:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49474215] [2024-05-12 13:33:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:15,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:33:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:33:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:33:15,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 255 transitions, 2580 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:15,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:15,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:15,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:17,201 INFO L124 PetriNetUnfolderBase]: 3097/7278 cut-off events. [2024-05-12 13:33:17,202 INFO L125 PetriNetUnfolderBase]: For 68112/68112 co-relation queries the response was YES. [2024-05-12 13:33:17,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22963 conditions, 7278 events. 3097/7278 cut-off events. For 68112/68112 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 70153 event pairs, 1802 based on Foata normal form. 6/6877 useless extension candidates. Maximal degree in co-relation 22830. Up to 5523 conditions per place. [2024-05-12 13:33:17,276 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 213 selfloop transitions, 66 changer transitions 0/289 dead transitions. [2024-05-12 13:33:17,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 289 transitions, 3266 flow [2024-05-12 13:33:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:33:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:33:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions. [2024-05-12 13:33:17,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2024-05-12 13:33:17,278 INFO L175 Difference]: Start difference. First operand has 330 places, 255 transitions, 2580 flow. Second operand 12 states and 220 transitions. [2024-05-12 13:33:17,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 289 transitions, 3266 flow [2024-05-12 13:33:17,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 289 transitions, 3071 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:33:17,743 INFO L231 Difference]: Finished difference. Result has 332 places, 255 transitions, 2520 flow [2024-05-12 13:33:17,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2385, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2520, PETRI_PLACES=332, PETRI_TRANSITIONS=255} [2024-05-12 13:33:17,743 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 289 predicate places. [2024-05-12 13:33:17,744 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 255 transitions, 2520 flow [2024-05-12 13:33:17,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:17,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:17,744 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] [2024-05-12 13:33:17,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-05-12 13:33:17,744 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:17,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1921127841, now seen corresponding path program 19 times [2024-05-12 13:33:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174151485] [2024-05-12 13:33:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:18,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174151485] [2024-05-12 13:33:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174151485] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:18,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:33:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106959089] [2024-05-12 13:33:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:18,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:33:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:18,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:33:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:33:18,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 13:33:18,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 255 transitions, 2520 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:18,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:18,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 13:33:18,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:19,945 INFO L124 PetriNetUnfolderBase]: 3127/7335 cut-off events. [2024-05-12 13:33:19,945 INFO L125 PetriNetUnfolderBase]: For 41624/41624 co-relation queries the response was YES. [2024-05-12 13:33:20,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22539 conditions, 7335 events. 3127/7335 cut-off events. For 41624/41624 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 70779 event pairs, 1767 based on Foata normal form. 6/6933 useless extension candidates. Maximal degree in co-relation 22405. Up to 5270 conditions per place. [2024-05-12 13:33:20,021 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 165 selfloop transitions, 105 changer transitions 0/280 dead transitions. [2024-05-12 13:33:20,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 280 transitions, 2964 flow [2024-05-12 13:33:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:33:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:33:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 13:33:20,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-05-12 13:33:20,023 INFO L175 Difference]: Start difference. First operand has 332 places, 255 transitions, 2520 flow. Second operand 10 states and 185 transitions. [2024-05-12 13:33:20,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 280 transitions, 2964 flow [2024-05-12 13:33:20,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 280 transitions, 2454 flow, removed 4 selfloop flow, removed 95 redundant places. [2024-05-12 13:33:20,175 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 2026 flow [2024-05-12 13:33:20,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2026, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2024-05-12 13:33:20,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places. [2024-05-12 13:33:20,176 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 2026 flow [2024-05-12 13:33:20,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:20,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:20,176 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] [2024-05-12 13:33:20,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-05-12 13:33:20,177 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:20,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1975732227, now seen corresponding path program 1 times [2024-05-12 13:33:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149532075] [2024-05-12 13:33:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149532075] [2024-05-12 13:33:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149532075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:33:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413482938] [2024-05-12 13:33:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:20,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:33:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:33:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:33:20,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-05-12 13:33:20,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 2026 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:20,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:20,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-05-12 13:33:20,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:20,634 INFO L124 PetriNetUnfolderBase]: 1840/4932 cut-off events. [2024-05-12 13:33:20,634 INFO L125 PetriNetUnfolderBase]: For 4948/4975 co-relation queries the response was YES. [2024-05-12 13:33:20,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13502 conditions, 4932 events. 1840/4932 cut-off events. For 4948/4975 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 47149 event pairs, 330 based on Foata normal form. 328/4961 useless extension candidates. Maximal degree in co-relation 13453. Up to 1265 conditions per place. [2024-05-12 13:33:20,658 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 102 selfloop transitions, 77 changer transitions 0/257 dead transitions. [2024-05-12 13:33:20,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 257 transitions, 2374 flow [2024-05-12 13:33:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:33:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:33:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-05-12 13:33:20,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6256410256410256 [2024-05-12 13:33:20,686 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 2026 flow. Second operand 5 states and 122 transitions. [2024-05-12 13:33:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 257 transitions, 2374 flow [2024-05-12 13:33:20,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 257 transitions, 2136 flow, removed 1 selfloop flow, removed 18 redundant places. [2024-05-12 13:33:20,718 INFO L231 Difference]: Finished difference. Result has 233 places, 249 transitions, 1998 flow [2024-05-12 13:33:20,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1998, PETRI_PLACES=233, PETRI_TRANSITIONS=249} [2024-05-12 13:33:20,719 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-05-12 13:33:20,719 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 249 transitions, 1998 flow [2024-05-12 13:33:20,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:20,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:20,719 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, 1, 1, 1, 1] [2024-05-12 13:33:20,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-05-12 13:33:20,720 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:20,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1056432477, now seen corresponding path program 1 times [2024-05-12 13:33:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970349721] [2024-05-12 13:33:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:20,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-05-12 13:33:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970349721] [2024-05-12 13:33:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970349721] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:20,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:33:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899031811] [2024-05-12 13:33:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:33:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:33:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:33:20,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-05-12 13:33:20,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 249 transitions, 1998 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 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-05-12 13:33:20,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:20,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-05-12 13:33:20,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:21,326 INFO L124 PetriNetUnfolderBase]: 1590/4325 cut-off events. [2024-05-12 13:33:21,327 INFO L125 PetriNetUnfolderBase]: For 5783/5787 co-relation queries the response was YES. [2024-05-12 13:33:21,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12609 conditions, 4325 events. 1590/4325 cut-off events. For 5783/5787 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 41054 event pairs, 762 based on Foata normal form. 100/4161 useless extension candidates. Maximal degree in co-relation 12564. Up to 1209 conditions per place. [2024-05-12 13:33:21,345 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 38 selfloop transitions, 15 changer transitions 187/273 dead transitions. [2024-05-12 13:33:21,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 273 transitions, 2434 flow [2024-05-12 13:33:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:33:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:33:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-05-12 13:33:21,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2024-05-12 13:33:21,346 INFO L175 Difference]: Start difference. First operand has 233 places, 249 transitions, 1998 flow. Second operand 8 states and 171 transitions. [2024-05-12 13:33:21,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 273 transitions, 2434 flow [2024-05-12 13:33:21,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 273 transitions, 2354 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 13:33:21,379 INFO L231 Difference]: Finished difference. Result has 244 places, 82 transitions, 567 flow [2024-05-12 13:33:21,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=567, PETRI_PLACES=244, PETRI_TRANSITIONS=82} [2024-05-12 13:33:21,379 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places. [2024-05-12 13:33:21,380 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 82 transitions, 567 flow [2024-05-12 13:33:21,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 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-05-12 13:33:21,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:21,380 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, 1, 1, 1, 1] [2024-05-12 13:33:21,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-05-12 13:33:21,380 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:21,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash -875529101, now seen corresponding path program 2 times [2024-05-12 13:33:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388594665] [2024-05-12 13:33:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:21,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388594665] [2024-05-12 13:33:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388594665] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:33:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522352659] [2024-05-12 13:33:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:21,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:33:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:33:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:33:21,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-05-12 13:33:21,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 82 transitions, 567 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:21,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:21,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-05-12 13:33:21,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:21,673 INFO L124 PetriNetUnfolderBase]: 491/1436 cut-off events. [2024-05-12 13:33:21,673 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2024-05-12 13:33:21,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4078 conditions, 1436 events. 491/1436 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11277 event pairs, 324 based on Foata normal form. 16/1355 useless extension candidates. Maximal degree in co-relation 4041. Up to 770 conditions per place. [2024-05-12 13:33:21,679 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 36 selfloop transitions, 4 changer transitions 26/95 dead transitions. [2024-05-12 13:33:21,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 95 transitions, 727 flow [2024-05-12 13:33:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:33:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:33:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-05-12 13:33:21,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-05-12 13:33:21,680 INFO L175 Difference]: Start difference. First operand has 244 places, 82 transitions, 567 flow. Second operand 6 states and 129 transitions. [2024-05-12 13:33:21,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 95 transitions, 727 flow [2024-05-12 13:33:21,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 95 transitions, 567 flow, removed 17 selfloop flow, removed 33 redundant places. [2024-05-12 13:33:21,685 INFO L231 Difference]: Finished difference. Result has 110 places, 67 transitions, 344 flow [2024-05-12 13:33:21,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=110, PETRI_TRANSITIONS=67} [2024-05-12 13:33:21,686 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-05-12 13:33:21,686 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 67 transitions, 344 flow [2024-05-12 13:33:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:21,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:21,687 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, 1, 1, 1, 1] [2024-05-12 13:33:21,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-05-12 13:33:21,688 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:21,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2080909771, now seen corresponding path program 3 times [2024-05-12 13:33:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165478863] [2024-05-12 13:33:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:21,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165478863] [2024-05-12 13:33:21,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165478863] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:21,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:21,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:33:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489093312] [2024-05-12 13:33:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:21,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:33:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:33:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:33:21,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-05-12 13:33:21,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 67 transitions, 344 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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-05-12 13:33:21,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:21,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-05-12 13:33:21,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:21,973 INFO L124 PetriNetUnfolderBase]: 359/1050 cut-off events. [2024-05-12 13:33:21,973 INFO L125 PetriNetUnfolderBase]: For 559/561 co-relation queries the response was YES. [2024-05-12 13:33:21,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1050 events. 359/1050 cut-off events. For 559/561 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7569 event pairs, 223 based on Foata normal form. 18/996 useless extension candidates. Maximal degree in co-relation 2683. Up to 493 conditions per place. [2024-05-12 13:33:21,976 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 30 selfloop transitions, 4 changer transitions 24/80 dead transitions. [2024-05-12 13:33:21,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 80 transitions, 488 flow [2024-05-12 13:33:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:33:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:33:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-05-12 13:33:21,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2024-05-12 13:33:21,977 INFO L175 Difference]: Start difference. First operand has 110 places, 67 transitions, 344 flow. Second operand 7 states and 138 transitions. [2024-05-12 13:33:21,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 80 transitions, 488 flow [2024-05-12 13:33:21,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 80 transitions, 469 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 13:33:21,980 INFO L231 Difference]: Finished difference. Result has 99 places, 54 transitions, 264 flow [2024-05-12 13:33:21,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=99, PETRI_TRANSITIONS=54} [2024-05-12 13:33:21,981 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2024-05-12 13:33:21,981 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 54 transitions, 264 flow [2024-05-12 13:33:21,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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-05-12 13:33:21,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:21,981 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, 1, 1, 1, 1] [2024-05-12 13:33:21,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-05-12 13:33:21,982 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:21,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash -788208525, now seen corresponding path program 4 times [2024-05-12 13:33:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931172448] [2024-05-12 13:33:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:33:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:33:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:33:22,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931172448] [2024-05-12 13:33:22,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931172448] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:33:22,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:33:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:33:22,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459057185] [2024-05-12 13:33:22,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:33:22,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:33:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:33:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:33:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:33:22,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-05-12 13:33:22,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 54 transitions, 264 flow. Second operand has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 9 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:22,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:33:22,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-05-12 13:33:22,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:33:22,423 INFO L124 PetriNetUnfolderBase]: 211/642 cut-off events. [2024-05-12 13:33:22,424 INFO L125 PetriNetUnfolderBase]: For 300/304 co-relation queries the response was YES. [2024-05-12 13:33:22,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 642 events. 211/642 cut-off events. For 300/304 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4114 event pairs, 32 based on Foata normal form. 24/619 useless extension candidates. Maximal degree in co-relation 1626. Up to 165 conditions per place. [2024-05-12 13:33:22,426 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 18 selfloop transitions, 6 changer transitions 30/72 dead transitions. [2024-05-12 13:33:22,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 72 transitions, 400 flow [2024-05-12 13:33:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:33:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:33:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-05-12 13:33:22,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-05-12 13:33:22,427 INFO L175 Difference]: Start difference. First operand has 99 places, 54 transitions, 264 flow. Second operand 10 states and 218 transitions. [2024-05-12 13:33:22,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 72 transitions, 400 flow [2024-05-12 13:33:22,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 72 transitions, 379 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 13:33:22,428 INFO L231 Difference]: Finished difference. Result has 91 places, 37 transitions, 154 flow [2024-05-12 13:33:22,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=154, PETRI_PLACES=91, PETRI_TRANSITIONS=37} [2024-05-12 13:33:22,429 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-05-12 13:33:22,429 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 37 transitions, 154 flow [2024-05-12 13:33:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 9 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:33:22,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:33:22,429 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, 1, 1, 1, 1] [2024-05-12 13:33:22,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-05-12 13:33:22,430 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:33:22,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:33:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2125412941, now seen corresponding path program 5 times [2024-05-12 13:33:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:33:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559447269] [2024-05-12 13:33:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:33:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:33:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:33:22,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:33:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:33:22,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:33:22,487 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:33:22,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-12 13:33:22,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 13:33:22,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 13:33:22,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-05-12 13:33:22,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 13:33:22,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 13:33:22,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 13:33:22,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-05-12 13:33:22,493 INFO L445 BasicCegarLoop]: Path program histogram: [19, 15, 14, 11, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:33:22,498 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:33:22,498 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:33:22,553 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 13:33:22,554 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 13:33:22,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:33:22 BasicIcfg [2024-05-12 13:33:22,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:33:22,555 INFO L158 Benchmark]: Toolchain (without parser) took 195225.23ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 138.5MB in the beginning and 951.8MB in the end (delta: -813.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-05-12 13:33:22,555 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:33:22,555 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:33:22,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 713.32ms. Allocated memory is still 172.0MB. Free memory was 138.5MB in the beginning and 104.8MB in the end (delta: 33.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-05-12 13:33:22,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.20ms. Allocated memory is still 172.0MB. Free memory was 104.8MB in the beginning and 102.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:33:22,556 INFO L158 Benchmark]: Boogie Preprocessor took 63.02ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 98.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 13:33:22,556 INFO L158 Benchmark]: RCFGBuilder took 618.17ms. Allocated memory is still 172.0MB. Free memory was 98.7MB in the beginning and 108.0MB in the end (delta: -9.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-05-12 13:33:22,556 INFO L158 Benchmark]: TraceAbstraction took 193759.59ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 106.9MB in the beginning and 951.8MB in the end (delta: -844.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-05-12 13:33:22,557 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.14ms. Allocated memory is still 136.3MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 713.32ms. Allocated memory is still 172.0MB. Free memory was 138.5MB in the beginning and 104.8MB in the end (delta: 33.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.20ms. Allocated memory is still 172.0MB. Free memory was 104.8MB in the beginning and 102.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.02ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 98.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 618.17ms. Allocated memory is still 172.0MB. Free memory was 98.7MB in the beginning and 108.0MB in the end (delta: -9.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 193759.59ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 106.9MB in the beginning and 951.8MB in the end (delta: -844.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L814] 0 //@ ghost multithreaded = 1; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L816] 0 //@ assert ((((((((((((((((!multithreaded || (0 <= __unbuffered_cnt)) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= __unbuffered_p1_EBX) && (__unbuffered_p1_EBX <= 2)) && (__unbuffered_p1_EBX <= 127)) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 2)) && (__unbuffered_p1_EAX <= 127)) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))))); [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L817] 0 //@ assert ((((((((((((((((!multithreaded || (0 <= __unbuffered_cnt)) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= __unbuffered_p1_EBX) && (__unbuffered_p1_EBX <= 2)) && (__unbuffered_p1_EBX <= 127)) && (((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)) || (__unbuffered_p1_EBX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 2)) && (__unbuffered_p1_EAX <= 127)) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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, 59 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: 193.6s, OverallIterations: 113, TraceHistogramMax: 1, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 101.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8044 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6965 mSDsluCounter, 3917 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3426 mSDsCounter, 1371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48672 IncrementalHoareTripleChecker+Invalid, 50043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1371 mSolverCounterUnsat, 491 mSDtfsCounter, 48672 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 31.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2604occurred in iteration=96, InterpolantAutomatonStates: 1055, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 89.9s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 2112 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 1971 ConstructedInterpolants, 0 QuantifiedInterpolants, 80829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 112 InterpolantComputations, 112 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-05-12 13:33:22,589 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